The single-vehicle two-echelon one-commodity pickup and delivery problem

DOI10.1016/J.COR.2020.105152MaRDI QIDQ2027019zbMATH OpenOpenAlexFDO

Authors Hipólito Hernández-Pérez, Mercedes Landete, Inmaculada Rodríguez-Martín

Publication date 21 May 2021

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2020.105152

zbMATH Keywords

branch-and-cutpickup and delivery problemtwo-echelon network

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases
• Single-commodity vehicle routing problem with pickup and delivery service
• The single vehicle routing problem with deliveries and selective pickups
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
• scientific article; zbMATH DE number 1953194
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem: A matheuristic
• Models for the single-vehicle preemptive pickup and delivery problem
• A stochastic and dynamic model for the single-vehicle pick-up and delivery problem
• One-to-many-to-one single vehicle pickup and delivery problems

Cites work

• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
• A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
• A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
• An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
• Exact solutions for the collaborative pickup and delivery problem
• Facility location problems with user cooperation
• Locating median cycles in networks
• Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer
• New mixed integer-programming model for the pickup-and-delivery problem with transshipment
• Projections of the capacitated network loading problem
• Solving the truck and trailer routing problem based on a simulated annealing heuristic
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• The multiple vehicle pickup and delivery problem with LIFO constraints
• The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
• The Ring Star Problem: Polyhedral analysis and exact algorithm

Cited in

(7)

• A multi-commodity two-echelon capacitated vehicle routing problem with time windows: model formulations and solution approach
• scientific article; zbMATH DE number 4076944 (Why is no real title available?)
• A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases
• A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem
• New models for close enough facility location problems
• A multi-period closed-loop supply chain network design with circular route planning
• The unit capacity pickup and delivery problem on a one-way loop

This page was built for publication: The single-vehicle two-echelon one-commodity pickup and delivery problem

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