A combined transportation and scheduling problem
Article Abstract:
A Lagrangean decomposition method for solving the problem of scheduling a fleet of vehicles to transport items from one point to another at minimal cost is introduced. The solution approach, which reduces the problem into trip planning and trip assignment subproblems, derives a suboptimal solution via two implementations, a fixed charge transshipment heuristic and a transportation and scheduling heuristic.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
Traffic & Transportation Mgmt, Operations research, Research, Case studies, Scheduling (Management), Mathematical optimization, Optimization theory, Traffic assignment
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
User Contributions:
Comment about this article or add new information about this topic:
New Opportunities for Operations Research u feature Issue of the Joint EURO/INFORMS Conference, Istanbul, July 2003
Article Abstract:
Events throwing light on new avenues in operations research held at Joint Euro/INFORM Conference, 2003 in Istanbul are detailed.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
Forecasts, trends, outlooks, Research and Development in the Social Sciences and Humanities, Turkey, Management & Information Science, Management Science, Forecasts and trends, Market trend/market analysis, Conference notes
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
User Contributions:
Comment about this article or add new information about this topic:
Subjects list: Management science
Similar abstracts:
- Abstracts: A variation of the assignment problem. An O(m log n) algorithm for the max + sum spanning tree problem. Fuzzy disk for covering fuzzy points
- Abstracts: Advertising opportunities don't come much sweeter than this. Starbucks launches cash card
- Abstracts: Two-machine flow shop scheduling with two criteria: maximum earliness and makespan. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs
- Abstracts: Common deodorants can pose a health threat. Discover your secret to everyday happy. Conquer anything with a bath
- Abstracts: Dynamic programming for delayed product differentiation. Discrete dynamic programming with outcomes in random variable structures
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
