Filters








1,025 Hits in 4.7 sec

Towards an efficient approximability for the Euclidean Capacitated Vehicle Routing Problem with Time Windows and multiple depots

Michael Khachay, Yuri Ogorodnikov
2019 IFAC-PapersOnLine  
We consider the Euclidean Capacitated Vehicle Routing Problem with Time Windows (CVRPTW).  ...  Abstract: We consider the Euclidean Capacitated Vehicle Routing Problem with Time Windows (CVRPTW).  ...  ACKNOWLEDGEMENTS Michael Khachay was supported by the Russian Foundation for Basic Research, grants no. 17-08-01385 and 19-07-01243.  ... 
doi:10.1016/j.ifacol.2019.11.606 fatcat:njap6rab4zentkioqibwsfp6gy

Page 845 of The Journal of the Operational Research Society Vol. 53, Issue 8 [page]

2002 The Journal of the Operational Research Society  
Both approaches have been examined, and the results showed that multiple iterations with tighter time windows are preferable.  ...  Standard MapInfo tools estimate the Euclidean distances between customers and between customers and the depot.  ... 

The split delivery vehicle scheduling problem with time windows and grid network distances

P.W. Frizzell, J.W. Giffin
1995 Computers & Operations Research  
Scope and Purpose~This paper considers the Vehicle Routing and Scheduling Problem, with numerous features added in an attempt to model more realistic problems.  ...  A construction heuristic is developed which uses a look-ahead approach to solve the Split Delivery Vehicle Scheduling Problem with Time Windows.  ...  INTRODUCTION In this paper we consider the Split Delivery Vehicle Routing and Scheduling Problem with Time Windows (SDVRSPTW).  ... 
doi:10.1016/0305-0548(94)00040-f fatcat:hacnojju7ffhnacwz7tm5fly5y

Map-Route: a GIS-based decision support system for intra-city vehicle routing with time windows

G Ioannou, M N Kritikos, G P Prastacos
2002 Journal of the Operational Research Society  
MACS- VRPTW: a multiple ant colony system for vehicle routing problems with time windows. In: Corne D, Dorigo M and Glover F (eds). New Ideas in Optimization. McGraw-Hill: London, UK, pp 63-76.  ...  Both approaches have been examined, and the results showed that multiple iterations with tighter time windows are preferable.  ... 
doi:10.1057/palgrave.jors.2601375 fatcat:ucff4v2uy5ch3i7tkszvh6d4eq

Vehicle Routing Problem with Backhaul, Multiple Trips and Time Window

Johan Oscar Ong, Suprayogi .
2011 Jurnal Teknik Industri  
This paper develops the new VRP variants', VRP with backhauls, multiple trips, and time window (VRPBMTTW) along with its problem solving techniques using Ant Colony Optimization (ACO) and Sequential Insertion  ...  ACO is modified by adding the decoding process in order to determine the number of vehicles, total duration time, and range of duration time regardless of checking capacity constraint and time window.  ...  VRP with Multiple Trips, Time Window, and Pickup Delivery (VRP-MTTWPD) VRPMTTWPD is a combination of variants vehicle routing problem with multiple trips (VRPMT), vehicle routing problem with time window  ... 
doi:10.9744/jti.13.1.1-10 fatcat:cupjwfo2hvgwfjg5gixxyx3t7q

Waste collection vehicle routing problem with time windows

Byung-In Kim, Seongbae Kim, Surya Sahoo
2006 Computers & Operations Research  
In this paper, we address a real life waste collection vehicle routing problem with time windows (VRPTW) with consideration of multiple disposal trips and drivers' lunch breaks.  ...  While minimizing the number of vehicles and total traveling time is the major objective of vehicle routing problems in the literature, here we also consider the route compactness and workload balancing  ...  In this paper, we present the algorithms for waste collection vehicle routing problem with time windows (VRPTW) with consideration of multiple dump site locations and drivers' lunch breaks.  ... 
doi:10.1016/j.cor.2005.02.045 fatcat:2n73gngnp5eqxp2te2edrp6i5y

An Exchange Heuristic for Routeing Problems with Time Windows

Jean-Yves Potvin, Jean-Marc Rousseau
1995 Journal of the Operational Research Society  
different exchange heuristics for vehicle routeing problems with time windows.  ...  In the Vehicle Routeing and Scheduling Problem with Time Windows (VRSPTW), these issues must be addressed with the additional complexity of allowable pick-up times or time windows at each customer location  ... 
doi:10.2307/2584063 fatcat:j2tbg4qhpbbxriwsobz5rm2p5q

Bridging the Gap Between Theory and Practice in the Vehicle Routing Research

Manar Ibrahim Hosny
2014 International Journal of Applied Mathematics Electronics and Computers  
Advances in technology and computational power have encouraged researchers to consider various vehicle routing problem types and constraints, and to experiment with new algorithmic techniques that can  ...  Research studying effective planning and optimization in the vehicle routing field has increased tremendously in the last few decades.  ...  Time Windows), and the multiple-depot variants of these problems.  ... 
doi:10.18100/ijamec.95178 fatcat:bwpmjmxzejftxozgniaumlwbea

Dynamic optimal control of Multiple Depot Vehicle Routing Problem with Metric Temporal Logic

Mariam Faied, Ahmed Mostafa, Anouck Girard
2009 2009 American Control Conference  
This paper discusses a class of mission planning problems that generalizes the standard Multiple Depot Vehicle Routing Problem with Time Windows (MDVRPTW) to incorporate complicated technical constraints  ...  In this work, we use tree search algorithm to seek the optimal flyable trajectories for teams of UAVs starting from different depots to complete missions with complicated time and technical requirements  ...  Since the Multiple Depot Vehicle Routing Problem with Time Window (MDVRPTW) is a generalization of the VRP itself, it is a NP-hard and NPcomplete.  ... 
doi:10.1109/acc.2009.5160144 dblp:conf/amcc/FaiedMG09 fatcat:4y2g6k66ybh3nheekh4iwa5egm

A Survey on the Vehicle Routing Problem and Its Variants

Suresh Nanda Kumar, Ramasamy Panneerselvam
2012 Intelligent Information Management  
In this paper, we have conducted a literature review on the recent developments and publications involving the vehicle routing problem and its variants, namely vehicle routing problem with time windows  ...  (VRPTW) and the capacitated vehicle routing problem (CVRP) and also their variants.  ...  They proposed an exact branch-and-p hm for solving the multiple vehicle routing problem with time windows.  ... 
doi:10.4236/iim.2012.43010 fatcat:bhzk37ixjnevhfj3shywxc2ccq

Tabu Search for the Vehicle Routing Problem with Multiple Trips, Time Windows, and Simultaneous Delivery-Pickup

Suprayogi Suprayogi, Yusuf Priyandari
2018 Jurnal Teknik Industri  
This paper discusses a vehicle routing problem with multiple trips, time windows, and simultaneous delivery-pickup (VRPMTTWSDP).  ...  This problem is a variant of the basic vehicle routing problem (VRP) including the following characteristics: multiple trips, time windows, and simultaneous delivery-pickup.  ...  Introduction This paper discusses a vehicle routing problem with multiple trips, time windows, and simultaneous delivery-pickup (VRPMTTWSDP).  ... 
doi:10.9744/jti.19.2.75-82 fatcat:gtbnxrikavagxnjwil3m6r2hzu

Vehicle Routing Problem with Time Windows: A Deterministic Annealing approach [article]

Mayank Baranwal, Pratik M. Parekh, Lavanya Marla, Srinivasa M. Salapaka, Carolyn L. Beck
2016 arXiv   pre-print
The Vehicle Routing Problem with Time-Windows (VRPTW) is an important problem in allocating resources on networks in time and space.  ...  We present in this paper a Deterministic Annealing (DA)-based approach to solving the VRPTW with its aspects of routing and scheduling, as well as to model additional constraints of heterogeneous vehicles  ...  ACKNOWLEDGMENT The authors would like to acknowledge NSF grants ECCS 15-09302 and CNS 15-44635 for supporting this work.  ... 
arXiv:1604.03590v1 fatcat:ohnezpe3pvaf7h2oyciudmna4y

Vehicle Routing Problem with Time Windows: A Deterministic Annealing approach

Mayank Baranwal, Pratik M. Parekh, Lavanya Marla, Srinivasa M. Salapaka, Carolyn L. Beck
2016 2016 American Control Conference (ACC)  
The Vehicle Routing Problem with Time-Windows (VRPTW) is an important problem in allocating resources on networks in time and space.  ...  We present in this paper a Deterministic Annealing (DA)-based approach to solving the VRPTW with its aspects of routing and scheduling, as well as to model additional constraints of heterogeneous vehicles  ...  ACKNOWLEDGMENT The authors would like to acknowledge NSF grants ECCS 15-09302 and CNS 15-44635 for supporting this work.  ... 
doi:10.1109/acc.2016.7525010 dblp:conf/amcc/BaranwalPMSB16 fatcat:mtmzplk6dre5vknp7liewgbfku

Research of Oil Product Secondary Distribution Optimization Based on Collaborative Distribution

Xuping Wang, Hongxin Zhan, Jun Zhang
2015 Procedia Computer Science  
In this paper we observe the extension of the multi-depot half open vehicle routing problem with time windows (MDHOVRPTW) in oil product secondary distribution.  ...  route can minimize the total cost and maximize the vehicle utilization.  ...  Acknowledgements The authors would like to thank the anonymous referees for your time and useful comments, which will be very helpful in improving this paper.  ... 
doi:10.1016/j.procs.2015.08.210 fatcat:dw2qc32z5rdmbfixsoraysguby

Dynamic Vehicle Routing Problem with Multiple Depots

Kwankaew Meesuptaweekoon, Paveena Chaovalitwongse
2014 Engineering Journal  
Dynamic Vehicle Routing Problem with Multiple Depots (D-MDVRP) extends the variation of VRPs to dynamism of customers by knowing the information of customers (both locations and due dates) at diverse times  ...  The Vehicle Routing Problems (VRPs) has been extensively studied and applied in many fields. Variations of VRPs have been proposed and appeared in research for many decades.  ...  Wanpracha Art Chaovalitwongse, Department of Industrial and System Engineering of the University of Washington, for guidance and feedback on the earlier drafts of this paper and recognition to anonymous  ... 
doi:10.4186/ej.2014.18.4.135 fatcat:lh7mosw2b5h4dcxssozsnastni
« Previous Showing results 1 — 15 out of 1,025 results