A Heuristic Algorithm for Multi-Period Delivery Planning Problems

DOI10.1080/02522667.1990.10699032zbMath0709.90725OpenAlexW2319955933MaRDI QIDQ3494695

M. Zafer Yakin, Parthasarati Dileepan, Basheer M. Khumawala

Publication date: 1990

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1990.10699032

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

Heuristic algorithm for topology optimization of continuum structure

Cites Work

• Methods for routing with time windows
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
• A Heuristic Algorithm for the Vehicle-Dispatch Problem

This page was built for publication: A Heuristic Algorithm for Multi-Period Delivery Planning Problems