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

DOI10.1111/itor.13234MaRDI QIDQ6195030

Unnamed Author, Mohammad Moshref-Javadi, Ahmad Hemmati

Publication date: 12 March 2024

Published in: International Transactions in Operational Research (Search for Journal in Brave)

zbMATH Keywords

metaheuristicrouting problempickup and deliverymultiple time windowsfourth-party logistics

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines
• A large neighbourhood search heuristic for ship routing and scheduling with split loads
• Dynamic pickup and delivery problems
• Simulated annealing for complex portfolio selection problems.
• An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation
• Pickup and delivery problem with time windows: a new compact two-index formulation
• Variable neighborhood search for vehicle routing problem with multiple time windows
• Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
• The pickup and delivery problem with time windows and occasional drivers
• Industrial and tramp ship routing problems: closing the gap for real-scale instances
• A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Ant colony system for a VRP with multiple time windows and multiple visits
• Finding Groups in Data
• The General Pickup and Delivery Problem
• Benchmark Suite for Industrial and Tramp Ship Routing and Scheduling Problems

This page was built for publication: Solving a pickup and delivery routing problem for fourth‐party logistics providers