New mixed integer-programming model for the pickup-and-delivery problem with transshipment

DOI10.1016/j.ejor.2013.10.038zbMath1305.90075OpenAlexW2145242240WikidataQ58788621 ScholiaQ58788621MaRDI QIDQ2256318

Abdur Rais, Marcio S. Carvalho, Filipe Alvelos

Publication date: 19 February 2015

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

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

zbMATH Keywords

integer programmingmodelingvehicle routingpickup-and-deliverytransshipmenttransportation-on-demand

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Related Items (18)

The multi-vehicle profitable pickup and delivery problem ⋮ Vehicle routing with cross-dock selection ⋮ Dynamic pooled capacity deployment for urban parcel logistics ⋮ The prisoner transportation problem ⋮ A multi-tiered vehicle routing problem with global cross-docking ⋮ The vessel swap-body routing problem ⋮ A dynamic scheduling process and methodology using route deviations and synchronized passenger transfers for flexible feeder transit services ⋮ Mathematical programming formulations and metaheuristics for biological sample transportation problems in healthcare ⋮ Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems ⋮ The rendezvous vehicle routing problem ⋮ Crowdsourced logistics: The pickup and delivery problem with transshipments and occasional drivers ⋮ Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers ⋮ A comparison of two meta-heuristics for the pickup and delivery problem with transshipment ⋮ A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments ⋮ The single-vehicle two-echelon one-commodity pickup and delivery problem ⋮ Real-time ride-sharing framework with dynamic timeframe and anticipation-based migration ⋮ The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach ⋮ The pickup and delivery problem with transshipments: critical review of two existing models and a new formulation

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The dial-A-ride problem with transfers
• A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources
• A comparative analysis of several asymmetric traveling salesman problem formulations
• The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
• Opportunities for OR in intermodal freight transport research: A review.
• Planning models for long-haul operations of postal and express shipment companies
• A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
• The dial-a-ride problem: Models and algorithms
• A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• The Vehicle Routing Problem
• A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics
• Heuristic Algorithms for the Handicapped Persons Transportation Problem
• The General Pickup and Delivery Problem
• The Pickup And Delivery Problem With Time Windows And Transshipment

This page was built for publication: New mixed integer-programming model for the pickup-and-delivery problem with transshipment