Single-commodity vehicle routing problem with pickup and delivery service
From MaRDI portal
Publication:1023173
DOI10.1155/2008/697981zbMath1162.90337OpenAlexW1986971574WikidataQ58646245 ScholiaQ58646245MaRDI QIDQ1023173
Goran Martinovic, Ivan Aleksi, Alfonzo Baumgartner
Publication date: 11 June 2009
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/55482
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Related Items (4)
Mathematical formulations for a 1-full-truckload pickup-and-delivery problem ⋮ A destroy and repair algorithm for the bike sharing rebalancing problem ⋮ Research on coordination and optimization of order allocation and delivery route planning in take-out system ⋮ A truck scheduling problem arising in intermodal container transportation
Uses Software
Cites Work
- Optimization by Simulated Annealing
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results
- A variable neighbourhood search algorithm for the open vehicle routing problem
- Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots
- Vehicle routing and crew scheduling for metropolitan mail distribution at Australia post
- A new tabu search algorithm for the vehicle routing problem with backhauls
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- The Vehicle Routing Problem
- An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
- The one‐commodity pickup and delivery travelling salesman problem on a path or a tree
This page was built for publication: Single-commodity vehicle routing problem with pickup and delivery service
