Affordable Access

Publisher Website

A heuristic algorithm for a pseudo-cyclic delivery problem under window constraints

Authors
Journal
European Journal of Operational Research
0377-2217
Publisher
Elsevier
Publication Date
Volume
31
Issue
1
Identifiers
DOI: 10.1016/0377-2217(87)90139-1
Keywords
  • Distribution
  • Integer Programming
  • Optimization
Disciplines
  • Computer Science

Abstract

Abstract The scheduling problem for pseudo-cyclic deliveries under window constraints is presented. The problem is formulated as a linear integer programming problem, where the objective function represented the minimization of the centralized supplier capacity needed to satisfy all user requests over a discretized planning horizon of infinite length. A heuristic algorithm running in polynomial time is illustrated and an experimental analysis of its efficiency is presented.

There are no comments yet on this publication. Be the first to share your thoughts.