Mathematical formulations for a 1-full-truckload pickup-and-delivery problem

DOI10.1016/J.EJOR.2014.10.053MaRDI QIDQ2630253zbMATH OpenOpenAlexFDO

Authors Michel Gendreau, Jenny Nossack, Erwin Pesch

Publication date 26 July 2016

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

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

zbMATH Keywords

asymmetric traveling salesman problemclassical Benders decompositiongeneralized Benders decompositionpickup and delivery problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1953194
• The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
• The multi-commodity pickup-and-delivery traveling salesman problem
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• The travelling salesman problem with pick-up and delivery

Cites work

• A Benders decomposition approach for the locomotive and car assignment problem
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• A Combined Vehicle Routing and Inventory Allocation Problem
• A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
• A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
• A review of dynamic vehicle routing problems
• A truck scheduling problem arising in intermodal container transportation
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Approximating Capacitated Routing and Delivery Problems
• Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
• Assignment Problems
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Daily Aircraft Routing and Scheduling
• Distribution system planning through a generalized Benders decomposition approach
• Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
• Generalized Benders decomposition
• Heuristic-based truck scheduling for inland container transportation
• Heuristics for the traveling salesman problem with pickup and delivery
• scientific article; zbMATH DE number 3643061 (Why is no real title available?)
• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• In pursuit of the traveling salesman. Mathematics at the limits of computation
• Multicommodity Distribution System Design by Benders Decomposition
• Opportunities for OR in intermodal freight transport research: A review.
• Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
• Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
• Partitioning procedures for solving mixed-variables programming problems
• Rich vehicle routing problems: from a taxonomy to a definition
• Simultaneous Assignment of Locomotives and Cars to Passenger Trains
• Single-commodity vehicle routing problem with pickup and delivery service
• Solution of a Large-Scale Traveling-Salesman Problem
• Solving an Electricity Generating Capacity Expansion Planning Problem by Generalized Benders' Decomposition
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• The General Pickup and Delivery Problem
• The one‐commodity pickup and delivery travelling salesman problem on a path or a tree
• The swapping problem
• The Swapping Problem on a Line
• The traveling salesman problem and its variations
• The traveling salesman problem. A computational study.
• Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition

Cited in

(4)

• Real-time ride-sharing framework with dynamic timeframe and anticipation-based migration
• A hybrid pricing and cutting approach for the multi-shift full truckload vehicle routing problem
• Mixed-integer linear optimization for full truckload pickup and delivery
• A truck scheduling problem arising in intermodal container transportation

Describes a project that uses

Uses Software

• VRP
• Concorde

This page was built for publication: Mathematical formulations for a 1-full-truckload pickup-and-delivery problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2630253)