An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation
type: Item
instance of: scholarly article
title: An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation
zbMATH Open document ID: 1380.90030
author: Farshid Azadian
author: Ratna Babu Chinnam
author: Alper Murat
published in: European Journal of Operational Research
publication date: 2018-02-06T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6835213
zbMATH Keywords: transportation
zbMATH Keywords: pickup and delivery problems
zbMATH Keywords: air cargo
zbMATH Keywords: multi-airport region
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.04.033
OpenAlex ID: W2606445152
cites work: Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
cites work: The swapping problem
cites work: Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
cites work: Dynamic pickup and delivery problems
cites work: Approximating Capacitated Routing and Delivery Problems
cites work: Comments on ``Surrogate gradient algorithm for Lagrangian relaxation''
cites work: Q3377692
cites work: The dial-a-ride problem: Models and algorithms
cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
cites work: Q4178782
cites work: Validation of subgradient optimization
cites work: Capacity options for revenue management. Theory and applications in the air cargo industry
cites work: A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
cites work: The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
cites work: The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
cites work: The multi-commodity pickup-and-delivery traveling salesman problem
cites work: An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
cites work: The vehicle routing problem: An overview of exact and approximate algorithms
cites work: Convergence and computational analyses for some variable target value and subgradient deflection methods
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: Surrogate gradient algorithm for Lagrangian relaxation
DOI: 10.1016/J.EJOR.2017.04.033
Recommended article: The Pickup And Delivery Problem With Time Windows And Transshipment
Recommended article: The airline container loading problem with pickup and delivery
Recommended article: The paired many-to-many pickup and delivery problem: an application
Recommended article: A probabilistic approach to pickup and delivery problems with time window uncertainty
Recommended article: A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources
Recommended article: The pickup and delivery problem with transshipments: critical review of two existing models and a new formulation
Recommended article: The pickup and delivery problem with time windows and handling operations
Recommended article: A New Approach to Freight Consolidation for a Real-World Pickup-and-Delivery Problem
Recommended article: The vehicle routing problem with simultaneous pickup and delivery and handling costs
description: scientific article; zbMATH DE number 6835213