A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times

DOI10.1016/j.cor.2017.06.021zbMath1391.90074OpenAlexW2726929936MaRDI QIDQ1651555

Simona Mancini

Publication date: 12 July 2018

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

Full work available at URL: https://doi.org/10.1016/j.cor.2017.06.021

zbMATH Keywords

vehicle routingset partitioningmultistarttime dependent travel times

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Related Items (5)

Vehicle routing with private and shared delivery locations ⋮ A comparison of algorithms for finding an efficient theme park tour ⋮ The collaborative consistent vehicle routing problem with workload balance ⋮ Combining workload balance and patient priority maximisation in operating room planning through hierarchical multi-objective optimisation ⋮ The heterogeneous fleet vehicle routing problem with draft limits

Uses Software

• GRASP

Cites Work

• Time-dependent routing problems: a review
• An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
• An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
• A way to optimally solve a time-dependent vehicle routing problem with time windows
• A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
• Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries
• Vehicle routing under time-dependent travel times: the impact of congestion avoidance
• Greedy randomized adaptive search procedures
• Vehicle dispatching with time-dependent travel times
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An annotated bibliography of GRASP – Part I: Algorithms
• A multi-start random constructive heuristic for the container loading problem
• Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems
• Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
• A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem
• Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
• Multi-Start Methods
• Efficient modeling of travel in networks with time-varying link speeds
• Vehicle routing and scheduling with time-varying data: A case study
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Handbook of metaheuristics

This page was built for publication: A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times