A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows

DOI10.1016/j.cor.2022.105766OpenAlexW3168784574MaRDI QIDQ2147032

Seyed Hamid Reza Pasandideh, Mina Roohnavazfar, Roberto Tadei

Publication date: 22 June 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.01652

zbMATH Keywords

time windowshybrid algorithmvehicle routing problemsand/or precedence constraints

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Uses Software

• VRP
• METSlib

Cites Work

• Unnamed Item
• Rich vehicle routing problems: from a taxonomy to a definition
• A disassembly line balancing problem with fixed number of workstations
• Improved approximations for TSP with simple precedence constraints
• Type-E disassembly line balancing problem with multi-manned workstations
• An exact solution method for multi-manned disassembly line design with and/or precedence relations
• Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
• A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
• Designing granular solution methods for routing problems with time windows
• Typology and literature review for dial-a-ride problems
• An efficient genetic algorithm for the traveling salesman problem with precedence constraints
• Combining simulated annealing with local search heuristics
• Machine scheduling with soft precedence constraints
• The dial-a-ride problem: Models and algorithms
• A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
• A unified solution framework for multi-attribute vehicle routing problems
• A review of vehicle routing with simultaneous pickup and delivery
• The Truck Dispatching Problem
• Vehicle Routing
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
• Scheduling with AND/OR Precedence Constraints
• The General Pickup and Delivery Problem
• Scheduling Tasks with AND/OR Precedence Constraints
• Parallel Machine Scheduling Through Column Generation: Minimax Objective Functions

This page was built for publication: A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows