A way to optimally solve a time-dependent vehicle routing problem with time windows

DOI10.1016/j.orl.2008.07.007zbMath1154.90608OpenAlexW2052069474MaRDI QIDQ1002083

Eulalia Martínez, David Soler, José Albiach

Publication date: 23 February 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10251/67274

zbMATH Keywords

vehicle routingtime windowtime-dependent costs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15)

Related Items (11)

The time-dependent shortest path and vehicle routing problem ⋮ Dealing with time in the multiple traveling salespersons problem with moving targets ⋮ A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times ⋮ Time-dependent routing problems: a review ⋮ The time-dependent orienteering problem with time windows: a fast ant colony system ⋮ The impact of time aggregation and travel time models on time-dependent routing solutions ⋮ Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery ⋮ The capacitated general windy routing problem with turn penalties ⋮ Electric vehicle routing problem with time-dependent waiting times at recharging stations ⋮ Solving the stochastic time-dependent orienteering problem with time windows ⋮ A way to optimally solve a green time-dependent vehicle routing problem with time windows

Uses Software

• VRP

Cites Work

• Unnamed Item
• A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
• A general heuristic for vehicle routing problems
• A heuristic algorithm for the asymmetric capacitated vehicle routing problem
• A dynamic vehicle routing problem with time-dependent travel times
• Vehicle dispatching with time-dependent travel times
• An efficient transformation of the generalized vehicle routing problem
• Time dependent vehicle routing problem with a multi ant colony system
• An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
• Vehicle routing and scheduling with dynamic travel times
• A new ILP-based refinement heuristic for vehicle routing problems
• An exact algorithm for the asymmetrical capacitated vehicle routing problem
• An Efficient Transformation Of The Generalized Traveling Salesman Problem

This page was built for publication: A way to optimally solve a time-dependent vehicle routing problem with time windows