An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation

DOI10.1016/J.EJOR.2017.04.033zbMath1380.90030OpenAlexW2606445152MaRDI QIDQ1695028

Farshid Azadian, Ratna Babu Chinnam, Alper Ekrem Murat

Publication date: 6 February 2018

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

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

zbMATH Keywords

transportationair cargomulti-airport regionpickup and delivery problems

Mathematics Subject Classification ID

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

Related Items (1)

Solving a pickup and delivery routing problem for fourth‐party logistics providers

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• Convergence and computational analyses for some variable target value and subgradient deflection methods
• Comments on ``Surrogate gradient algorithm for Lagrangian relaxation
• Dynamic pickup and delivery problems
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
• The vehicle routing problem: An overview of exact and approximate algorithms
• Surrogate gradient algorithm for Lagrangian relaxation
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• The dial-a-ride problem: Models and algorithms
• Capacity options for revenue management. Theory and applications in the air cargo industry
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• The multi-commodity pickup-and-delivery traveling salesman problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• The swapping problem
• Approximating Capacitated Routing and Delivery Problems
• An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
• Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
• Validation of subgradient optimization
• The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms

This page was built for publication: An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation