A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Filters
A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
2006
European Journal of Operational Research
Preserved Fulltext
In this paper we present a new insertion-based construction heuristic to solve the multivehicle pickup and delivery problem with time windows. ...
We compared our heuristic with a sequential and a parallel insertion heuristic on different benchmarking problems, and the computational results show that the proposed heuristic performs better with respect ...
Acknowledgements The research reported in this paper was partially supported by the National Science Foundation under grant DMI-9732878. ...
doi:10.1016/j.ejor.2005.05.012
fatcat:vqjrxltzf5hizmmz6bvfutkqw4
PICKUP AND DELIVERY WITH TIME WINDOWS: ALGORITHMS AND TEST CASE GENERATION
2002
International journal on artificial intelligence tools
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In the pickup and delivery problem with time windows (PDPTW), vehicles have to transport loads from origins to destinations respecting capacity and time constraints. ...
Another contribution of this paper is a strategy to generate good problem instances and benchmarking solutions for PDPTW, based on Solomon's benchmark test cases for VRPTW. ...
Conclusion In this paper, we presented a two-phase approach to solve the Pickup and Delivery Problem with Time Windows (PDPTW). ...
doi:10.1142/s0218213002000988
fatcat:ghap3alwuvhuhji7uinh67seje
A survey on pickup and delivery problems
2008
Journal für Betriebswirtschaft
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
These are the Pickup and Delivery Vehicle Routing Problem (PDVRP -unpaired pickup and delivery points), the classical Pickup and Delivery Problem (PDP -paired pickup and delivery points), and the Dial-A-Ride ...
The second part now considers all those problems where goods are transported between pickup and delivery locations, denoted as Vehicle Routing Problems with Pickups and Deliveries (VRPPD). ...
Special thanks go to Michel Gendreau and Jacques Desrosiers for their kind support as well as to two anonymous referees for their valuable comments. ...
doi:10.1007/s11301-008-0036-4
fatcat:wv5idhicxvdvvmntj36f5mnpqq
A Review on the Evolution of Vehicle Routing Problems
2015
SAMRIDDHI A Journal of Physical Sciences Engineering and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
It is suggested that as to how VRPBH framework of Goetschalckx and Jacobs-Blecha has offered better solution to routing problems that Clarke-Wright Savings matrix and with the introduction of time -window ...
concept the result of heuristic has improved drastically. ...
Fleischmann et al. (2004) utilized route construction methods already proposed in the literature, savings and insertion, to solve uncapacitated time dependent VRP with and without time windows. ...
doi:10.18090/samriddhi.v1i2.1581
fatcat:ftqk5juscrhdfbxjyyqlgxbpka
Real-time vehicle rerouting problems with time windows
2009
European Journal of Operational Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
This paper introduces and studies real-time vehicle rerouting problems with time windows, applicable to delivery and/or pickup services that undergo service disruptions due to vehicle breakdowns. ...
A Lagrangian relaxation based-heuristic is developed, which includes an insertion based-algorithm to obtain a feasible solution for the primal problem. ...
Acknowledgments -The authors would like to express their sincere thanks to two anonymous referees for their valuable and constructive suggestions. ...
doi:10.1016/j.ejor.2007.12.037
fatcat:typ7lhuw5rd27drlm7aw3wx2cy
Description of the classification of publications and the models used in solving of the vehicle routing problem with pickup and delivery
2016
Revista Ingenierías Universidad de Medellín
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Key words: complexity of the problem, mathematical programming, methods of solution, modeling tools, vehicle routing problem with delivery and pickups, future trends and treatment of the problem. ...
This review paper presents the description of the state of the art of the vehicle routing problem with pickups and deliveries, vrppd, product obtained from the literature review of most of the models reported ...
Concurrently, the problem "A population-based metaheuristic for the pickup and delivery problem with time windows and lifo loading" was resolved for three exact branch-price-and-cut algorithms [20] . ...
doi:10.22395/rium.v15n28a14
fatcat:vc4ndx3mtja2ffv4ip5neq4ypq
An Evolutionary Approach to Pickup and Delivery Problem with Time Windows
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A great deal of real transport problems may be modelled by using Pickup and Delivery Problem with Time Windows (PDPTW) and capacity constraints, which is based on the realization of a set of transport ...
This paper is aimed at proposing a straightforward extension of VRPTW based heuristics for the PDPTW. ...
problem (PDP), pickup and delivery problem with time windows (PDPTW). ...
doi:10.1007/978-3-540-24688-6_142
fatcat:h6jbuhufh5a47i3jzxwlpt7gxu
Constructing initial solutions for the multiple vehicle pickup and delivery problem with time windows
2012
Journal of King Saud University: Computer and Information Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The Multiple Vehicle Pickup and Delivery Problem with Time Windows (MV-PDPTWs) is an important problem in logistics and transportation. ...
Indeed, merely constructing a feasible solution to this hard problem is a challenge in itself. ...
Introduction The Multiple Vehicle Pickup and Delivery Problem with Time Windows (MV-PDPTWs) is a variant of the well-known Vehicle Routing Problem with Time Windows (VRPTWs). ...
doi:10.1016/j.jksuci.2011.10.006
fatcat:qb6ypj222ncajlqgvho4mkcaki
A survey on pickup and delivery problems
2008
Journal für Betriebswirtschaft
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
OR Spektrum 23:79-96 Dethloff J (2002) Relation between vehicle routing problems: An insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing ...
These are the Pickup and Delivery Vehicle Routing Problem (PDVRP -unpaired pickup and delivery points), the classical Pickup and Delivery Problem (PDP -paired pickup and delivery points), and the Dial-A-Ride ...
Special thanks go to Michel Gendreau and Jacques Desrosiers for their kind support as well as to two anonymous referees for their valuable comments. ...
doi:10.1007/s11301-008-0033-7
fatcat:oqvjk26ukva63gxo7kctdgsvpe
Exact Algorithm for Dial-A-Ride Problems with Time-Dependent Travel Cost
2013
Journal of the Eastern Asia Society for Transportation Studies
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In the numerical experiments, several scenarios with the different time window are conducted and evaluate experimental results by objective value, computational time, average pickup delay time and average ...
delivery delay time. ...
Ropke and Pisinger (2006) built an adaptive large neighborhood search heuristic (LNS) for the pickup and delivery problem with time window. ...
doi:10.11175/easts.10.916
fatcat:4fkqxexuknbfpplkcf3xqlxeaa
A hybrid discrete artificial bee colony for the green pickup and delivery problem with time windows
2020
Informatica (Ljubljana, Tiskana izd.)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
This paper formulates a new optimization pickup and delivery problem with time windows which take into account CO2 emissions. ...
This new NP-hard combinatorial optimization problem is called green pickup and delivery problem with time windows (GPDPTW), the recent development in the vehicle routing problem and its variants, which ...
Lu et Dessouky [14] presented a new insertion-based construction heuristic to solve the multi-vehicle pickup and delivery problem with time windows. ...
doi:10.31449/inf.v44i4.3000
fatcat:vvxziajuqjdllk63liy62kg5hu
Scheduling for Transfers in Pickup and Delivery Problems with Very Large Neighborhood Search
2014
PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In pickup and delivery problems (PDPs), vehicles pickup and deliver a set of items under various constraints. ...
We show that VLNS-T improves upon the best known PDP solutions for benchmark problems, and demonstrate its effectiveness on problems sampled from real world taxi data in New York City. ...
Acknowledgements We thank Huy Vo and Claudio Silva, from the Center for Urban Science and Progress (CUSP) of New York University, for providing the New York City taxi data used in this work to us. ...
doi:10.1609/aaai.v28i1.9034
fatcat:u3hjhh4q4bhwpcy37lazuw2mu4
A deterministic annealing algorithm for the pre- and end-haulage of intermodal container terminals
2010
International Journal of Computer Aided Engineering and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The drayage of containers in the service area of an intermodal barge terminal is modelled as a full truckload pickup and delivery problem with time windows (FT-PDPTW). ...
Initial solutions are generated with an insertion heuristic and improved with three local search operators. ...
A heuristic procedure based on merging pickup and delivery customers is used to construct initial solutions. ...
doi:10.1504/ijcaet.2010.035390
fatcat:bsqxvmn3erb5fprokf7jy4b4am
Dynamic routing model and solution methods for fleet management with mobile technologies
2008
International Journal of Production Economics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This mathematical model includes solving a static problem as well as a problem for dynamic change of the route plan. We propose heuristic solution methods for both the static and dynamic problems. ...
Such technologies can lead to the real-time update of information of new customer orders, including their expected arrival time at the pickup locations, their vehicle capacity consumption, their delivery ...
This research was supported in part by The Hong Kong Polytechnic University under grant numbers G-YE13 and G-YE58. ...
doi:10.1016/j.ijpe.2007.10.018
fatcat:46hk3ipaonbijkgwqmu5gighdu
A unified heuristic for a large class of Vehicle Routing Problems with Backhauls
2006
European Journal of Operational Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
The unified model can be seen as a Rich Pickup and Delivery Problem with Time Windows, which can be solved through an improved version of the large neighborhood search heuristic proposed by Ropke (2003 ...
The underlying problem of all of the problems we consider is the Pickup and Delivery Problem with Time Windows (PDPTW), which we will describe in Section 2. ...
Thangiah and Daniele Vigo for kindly providing us with the data sets used in this paper and for answering questions regarding the data sets. ...
doi:10.1016/j.ejor.2004.09.004
fatcat:sysdzisy2rexdbm4mvf4whpo7u
« Previous
Showing results 1 — 15 out of 1,156 results