Filters








11,870 Hits in 7.6 sec

Branch-and-Check with Explanations for the Vehicle Routing Problem with Time Windows [chapter]

Edward Lam, Pascal Van Hentenryck
2017 Lecture Notes in Computer Science  
Experimental results on the Vehicle Routing Problem with Time Windows show that BCE is a potential alternative to branchand-cut.  ...  This paper proposes the framework of branch-and-check with explanations (BCE), a branch-and-cut method where combinatorial cuts are found by general-purpose conflict analysis, rather than by specialized  ...  The Vehicle Routing Problem with Time Windows (VRPTW) additionally requires requests to be delivered within a given time window.  ... 
doi:10.1007/978-3-319-66158-2_37 fatcat:njvnoob3mbbatbqskg5eylyqsu

A New Heuristic Algorithm for Multi Vehicle Routing Problem with AND/OR-Type Precedence Constraints and Hard Time Windows

Unes Bahalke, Nima Hamta, Amir Reza Shojaeifard, Maryam Alimoradi, Samira Rabiee
2022 Operational Research in Engineering Sciences: Theory and Applications  
The procedure is based on recently enhanced Benders' decomposition approach named as Branch and Search Algorithm, partitioning the original main problem into allocation and routing parts.  ...  In this paper the classic known Multi Vehicle Routing Problem (VRP) is studied where classically several vehicles are set in a central depot, depending on the allocation strategy, each vehicle starts traveling  ...  for a vehicle routing problem with time windows and multiple use of vehicles (Azi, 2010)   Branch and price for the time-dependent vehicle routing problem with time windows (Dabia, 2013)   A hybrid  ... 
doi:10.31181/oresta300622015b doaj:38b3e32b831047c0a7a8dd9c70abccd2 fatcat:xd7j57eyj5aaxivyu3iz43smvq

The Optimization Model and Empirical Analysis for Vehicle Routing Problems with Time Windows Based on C-W Algorithm [chapter]

Lijuan Fan, Qiuli Qin
2012 LISS 2012  
Considering the vehicle routing problems with time window restriction, we combine the typical practical situation to establish the proper model. Based on c-w saving algorithm.  ...  distribution system of S company to find the vehicle routing problems.  ...  Vehicle Routing Problem with Time Window (VRPTW) is increased the customer access time window constrain on the basis of Vehicle Routing Problem, the constraint allows Vehicle Routing Problem with Time  ... 
doi:10.1007/978-3-642-32054-5_38 fatcat:p7fba43anbd6zmdyavqcdizcwi

Branch-and-Price-and-Cut for the Active-Passive Vehicle-Routing Problem

Christian Tilk, Nicola Bianchessi, Michael Drexl, Stefan Irnich, Frank Meisel
2018 Transportation Science  
.: Branch-and-Price-and-Cut for the Active-Passive Vehicle-Routing Problem Tilk et al.: Branch-and-Price-and-Cut for the Active-Passive Vehicle-Routing Problem  ...  The contribution of the paper is twofold: Firstly, we present an exact branch-and-price-and-cut algorithm for this class of routing problems with synchronization constraints.  ...  For the sake of explanation, we vary the time window [e j , l j ] of vertex j.  ... 
doi:10.1287/trsc.2016.0730 fatcat:isuowulykjgthfwrtsnlzqmyqq

What's Hot at CPAIOR (Extended Abstract)

Claude-Guy Quimper
2017 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
In order to trigger exchanges between the constraint programming and the operations research community, CPAIOR was co-located with CORS 2016, the Canadian Operational Research society's conference.  ...  The 13th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming (CPAIOR 2016), was held in Banff, Canada, May 29 - June 1, 2016.  ...  In A Branch-and-Price-and-Check Model for the Vehicle Routing Problem with Location Resource Constraints, (Lam and Van Hentenryck 2016) solve a routing problem with pickup and delivery, time windows,  ... 
doi:10.1609/aaai.v31i1.10640 fatcat:nsvn7tyaznb6pnsakg75myszri

Solving the vehicle routing problem with lunch break arising in the furniture delivery industry

Leandro C Coelho, Jean-Philippe Gagliardi, Jacques Renaud, Angel Ruiz
2016 Journal of the Operational Research Society  
5 In this paper we solve the Vehicle Routing Problem with Lunch Break (VRPLB) which arises when drivers must take pauses during their shift, for example, for lunch breaks.  ...  This problem, which appears in the furniture delivery industry, includes rich features such as time windows and heterogeneous vehicles.  ...  We also thank Louis Leclerc, Operations Manager, and Steve Thiboutot, Information Systems 20 Manager, from Ameublement Tanguay, for their constant availability and comments, and for providing us with relevant  ... 
doi:10.1057/jors.2015.90 fatcat:i4g36urz6ne47aw4wq4gvwm2au

Nested column generation applied to the crude oil tanker routing and scheduling problem with split pickup and split delivery

Frank Hennig, Bjørn Nygreen, Marco E. Lübbecke
2012 Naval Research Logistics  
relations for pickup and delivery of each commodity, sequence dependent vehicle capacities, and cargo quantity dependent pickup and delivery times.  ...  The split pickup split delivery crude oil tanker routing and scheduling problem is a difficult combinatorial optimization problem, both theoretically and practically.  ...  The authors thank Dr. Michael Drexl for his comments and support in connection with the use of the boost resource constraint shortest path algorithm.  ... 
doi:10.1002/nav.21489 fatcat:f67kj4nxurbqrlvcktfx2ufshe

A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows

Jonathan F. Bard, George Kontoravdis, Gang Yu
2002 Transportation Science  
Numerical results for standard 50-and 100-node benchmark problems are reported. The vehicle routing problem with time windows (VRPTW) can be defined as follows.  ...  T his paper addresses the problem of finding the minimum number of vehicles required to visit a set of nodes subject to time window and capacity constraints.  ...  Numerical results for standard 50-and 100-node benchmark problems are reported. The vehicle routing problem with time windows (VRPTW) can be defined as follows.  ... 
doi:10.1287/trsc.36.2.250.565 fatcat:jsberefiqbcq3gyycmorr43njy

The time-dependent pickup and delivery problem with time windows

Peng Sun, Lucas P. Veelenturf, Mike Hewitt, Tom Van Woensel
2018 Transportation Research Part B: Methodological  
accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the  ...  Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of  ...  Acknowledgments The authors gratefully acknowledge funds provided by China Scholarship Council (CSC) under Grant No.201206160092 and the German Research Foundation (DFG, project GO 1841/5-1).  ... 
doi:10.1016/j.trb.2018.07.002 fatcat:pcwbkj2vcnagtk7fo6czuguceu

Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach

D. Taş, M. Gendreau, N. Dellaert, T. van Woensel, A.G. de Kok
2014 European Journal of Operational Research  
Abstract We study a vehicle routing problem with soft time windows and stochastic travel times.  ...  Vehicle routing with soft time windows and stochastic travel times : a column generation and branch-and-price solution approach Tas, D.; Gendreau, M.; Dellaert, N.P.; van Woensel, T.; de Kok, A.G.  ...  Vehicle Routing with Soft Time Windows and Stochastic Travel Times: A Column Generation and Branch-and-Price Solution Approach Introduction The Vehicle Routing Problem (VRP), sometimes referred to as  ... 
doi:10.1016/j.ejor.2013.05.024 fatcat:uu2bg62iq5bd7izgzvtq2giyym

An Heuristic Approach to Solving the one-to-one Pickup and Delivery Problem with Threedimensional Loading Constraints

Rémy Dupas, Igor Grebennik, Oleksandr Lytvynenko, Oleksij Baranov
2017 International Journal of Information Technology and Computer Science  
A mathematical model and a solving strategy for the Pickup and Delivery Problem with threedimensional loading constraints regarding a combinatorial configuration instead of a traditional approach that  ...  A traditional one-to-one Pickup and Delivery Problem in a combination with a problem of packing transported items into vehicles by means of the proposed combinatorial generation algorithm is solved.  ...  The Ropke's work is devoted to the multi-vehicle PDP problem with time windows. A formulation of the Ropke's problem also takes into account a capacity Q of every vehicle.  ... 
doi:10.5815/ijitcs.2017.10.01 fatcat:jgoxrpuf5ffztg4pquzulgtnna

A rolling horizon algorithm for auto-carrier transportation

Jean-François Cordeau, Mauro Dell'Amico, Simone Falavigna, Manuel Iori
2015 Transportation Research Part B: Methodological  
A branch-and-bound search is used to check the feasibility of the loading. To handle the dynamic nature of the problem, the complete algorithm is applied repeatedly in a rolling horizon framework.  ...  In addition, the routing of the auto-carriers must take into account constraints related to the loading of the vehicles on the carriers.  ...  Acknowledgements This work was partly supported by the Canadian Natural Sciences and Engineering Research Council under grant 227837-09 and by CAPES/Brazil under Grant PVE no. A007/2013.  ... 
doi:10.1016/j.trb.2015.02.009 fatcat:wfeubtfcs5h6joyw55ubwkyade

The Time Window Assignment Vehicle Routing Problem with Time-Dependent Travel Times

Remy Spliet, Said Dabia, Tom Van Woensel
2018 Transportation Science  
In this paper, we introduce the time window assignment vehicle routing problem (TWAVRP) with time-dependent travel times.  ...  It is the problem of assigning time windows to customers before their demand is known and creating vehicle routes adhering to these time windows after demand becomes known.  ...  by Cordeau, Ghiani, and Guerriero (2014) , for the pollution-routing problem by Franceschetti et al. (2013) , for the vehicle routing problem with time windows by Dabia et al. (2013) , and for the  ... 
doi:10.1287/trsc.2016.0705 fatcat:vuwjk6fv4zg3fnatgwc7isiyni

Large Neighborhood Search for Dial-a-Ride Problems [chapter]

Siddhartha Jain, Pascal Van Hentenryck
2011 Lecture Notes in Computer Science  
The core of a DARP is a pick and delivery routing with multiple vehicles in which customers have ride-time constraints and routes have a maximum duration.  ...  This paper considers DARPs for which the objective is to minimize the routing cost, a complex optimization problem which has been studied extensively in the past.  ...  Conclusions and Future Work This paper considered Dial-a-Ride applications, which are complex multiple-vehicle routing problems with pickups and deliveries, time windows, and constraints on the ride time  ... 
doi:10.1007/978-3-642-23786-7_31 fatcat:kuwf27o6pfap7ppm3r2f7ztnhq

Pheromone-Based Heuristic Column Generation for Vehicle Routing Problems with Black Box Feasibility [chapter]

Florence Massen, Yves Deville, Pascal Van Hentenryck
2012 Lecture Notes in Computer Science  
This paper proposes an abstraction of emerging vehicle routing problems, the Vehicle Routing Problem with Black Box Feasibility.  ...  The difficulty in addressing the VRP with Black Box Feasibility lies in the unknown problem structure and the costly feasibility check.  ...  Acknowledgment The authors would like to thank Fabien Tricoire for making available the feasibility checks for the MP-VRP as well as for his explanations.  ... 
doi:10.1007/978-3-642-29828-8_17 fatcat:hn53dla2rffqxi3wl7s4w2apqu
« Previous Showing results 1 — 15 out of 11,870 results