A scheme for determining vehicle routes based on Arc-based service network design
From MaRDI portal
Publication:5881488
DOI10.1080/03155986.2016.1262580OpenAlexW2543502461MaRDI QIDQ5881488
Graham Kendall, Jason A. D. Atkin, Xiaoping Jiang, Ruibin Bai
Publication date: 10 March 2023
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03155986.2016.1262580
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items (2)
Lagrange dual bound computation for stochastic service network design ⋮ Soft clustering-based scenario bundling for a progressive hedging heuristic in stochastic service network design
Uses Software
Cites Work
- Unnamed Item
- A hybrid heuristic for the set covering problem
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- The vehicle routing problem: An overview of exact and approximate algorithms
- The dial-a-ride problem (DARP): variants, modeling issues and algorithms
- Service network design in freight transportation
- A survey on Benders decomposition applied to fixed-charge network design problems
- Service network design for freight transportation: a review
- A dynamic driver management scheme for less-than-truckload carriers
- A first multilevel cooperative algorithm for capacitated multicommodity network design
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- A Heuristic Method for the Set Covering Problem
- Depth-First Search and Linear Graph Algorithms
- Single-Commodity Network Design with Stochastic Demand and Multiple Sources and Sinks
- Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows
- Ant colony algorithm for the multi-depot vehicle routing problem in large quantities by a heterogeneous fleet of vehicles
- Valid Inequalities and Separation Algorithms for the Set Partitioning Problem
This page was built for publication: A scheme for determining vehicle routes based on Arc-based service network design