Single vehicle routing with a predefined customer sequence and multiple depot returns

DOI10.1016/j.ejor.2007.03.017zbMath1149.90024OpenAlexW2032293836MaRDI QIDQ2463499

A. Tatarakis, Epaminondas G. Kyriakidis, P. Tsirimpas, Ioannis Minis

Publication date: 12 December 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.03.017

zbMATH Keywords

dynamic programminglogisticsrouting with multiple-product deliveryrouting with pick up and delivery

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Production models (90B30) Dynamic programming (90C39)

Related Items (16)

Single vehicle routing with predefined client sequence and multiple warehouse returns: the case of two warehouses ⋮ Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands ⋮ Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge ⋮ Stochastic single vehicle routing problem with delivery and Pick up and a predefined customer sequence ⋮ Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence ⋮ Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands ⋮ Vehicle routing problems with multiple trips ⋮ A stochastic single vehicle routing problem with a predefined sequence of customers and collection of two similar materials ⋮ Vehicle routing problems with multiple trips ⋮ Buy online and pick up in-store: design of the service area ⋮ SINGLE VEHICLE ROUTING PROBLEMS WITH A PREDEFINED CUSTOMER ORDER, UNIFIED LOAD AND STOCHASTIC DISCRETE DEMANDS ⋮ A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands ⋮ A near-optimal database allocation for reducing the average waiting time in the grid computing environment ⋮ Integrated production and distribution scheduling with lifespan constraints ⋮ Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns ⋮ Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• A unified heuristic for a large class of vehicle routing problems with backhauls
• A stochastic and dynamic model for the single-vehicle pick-up and delivery problem
• The vehicle routing problem: An overview of exact and approximate algorithms
• Hybrid metaheuristics for the vehicle routing problem with stochastic demands
• The Vehicle Routing Problem
• Stochastic Vehicle Routing Problem with Restocking
• A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
• The vehicle routing problem with pickups and deliveries on some special graphs

This page was built for publication: Single vehicle routing with a predefined customer sequence and multiple depot returns