Heuristics for routes generation in pickup and delivery problem

DOI10.1007/s10100-012-0239-6zbMath1339.90063OpenAlexW2031475965MaRDI QIDQ300807

Jan Pelikán, Jan Fábry

Publication date: 29 June 2016

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-012-0239-6

zbMATH Keywords

integer programmingheuristic methodpickup and delivery problem

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Special issue of the Czech Society for Operations Research ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review

Cites Work

• A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases
• Real-time split-delivery pickup and delivery time window problems with transfers
• An empirical study on the benefit of split loads with the pickup and delivery problem
• Heuristics for the lexicographic Max-ordering vehicle routing problem
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• The Rollon–Rolloff Vehicle Routing Problem
• The General Pickup and Delivery Problem
• Arc Routing Problems, Part I: The Chinese Postman Problem

This page was built for publication: Heuristics for routes generation in pickup and delivery problem