Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Math Meth Oper Res

Search In Journal Title:

Abbravation: Mathematical Methods of Operations Research

Search In Journal Abbravation:

Publisher

Springer Berlin Heidelberg

Search In Publisher:

DOI

10.1016/0886-7798(94)90025-6

Search In DOI:

ISSN

1432-5217

Search In ISSN:
Search In Title Of Papers:

Computational complexity of convoy movement planni

Authors: Ram Gopalan
Publish Date: 2015/05/21
Volume: 82, Issue: 1, Pages: 31-60
PDF Link

Abstract

Convoy movement planning problems arise in a number of important logistical contexts including military planning railroad optimization and automated guided vehicle routing In the convoy movement problem CMP a set of convoys with specified origins and destinations are to be routed with the objective of minimizing either makespan or total flow time while observing a number of side constraints This paper characterizes the computational complexity of several restricted classes of CMPs The principal objective is to identify the most parsimonious set of problem features that make the CMP intractable A polynomialtime algorithm is provided for the single criterion twoconvoy movement problem The performance of a simple prioritization–idling approximation algorithm is also analyzed for the Kconvoy movement problem Error bounds are developed for the makespan and flow time objectives

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem
  2. A mathematical approach to solve the network reconstruction problem
  3. Risk pooling strategy in a multi-echelon supply chain with price-sensitive demand
  4. Combinatorial integral approximation
  5. The restricted core of games on distributive lattices: how to share benefits in a hierarchy
  6. On the existence of almost-pure-strategy Nash equilibrium in n -person finite games
  7. Biconvex sets and optimization with biconvex functions: a survey and extensions
  8. Performance analysis approximation in a queueing system of type M/G/1
  9. Could we use a million cores to solve an integer program?
  10. Asymptotic expansions of defective renewal equations with applications to perturbed risk models and processor sharing queues
  11. Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs
  12. Loss rates in the single-server queue with complete rejection
  13. Irreversible investments with delayed reaction: an application to generation re-dispatch in power system operation
Search Result: