Journal article
Solving transportation problems with mixed constraints
International journal of management science and engineering management, v 1(1), pp 47-52
01 Jan 2006
Featured in Collection : UN Sustainable Development Goals @ Drexel
Abstract
In this paper we provide a heuristic algorithm for solving transportation problems with mixed constraints and extend the algorithm to find a more-for-less (MFL) solution, if one exists. Though many transportation problems in real life have mixed constraints, these problems are not addressed in the literature because of the rigor required to solve these problems optimally. The proposed algorithm builds on the initial solution of the transportation problem.
Metrics
Details
- Title
- Solving transportation problems with mixed constraints
- Creators
- Veena Adlakha - University of BaltimoreKrzysztof Kowalski - Connecticut Department of TransportationBenjamin Lev - University of Michigan–Dearborn
- Publication Details
- International journal of management science and engineering management, v 1(1), pp 47-52
- Publisher
- Taylor & Francis
- Number of pages
- 6
- Resource Type
- Journal article
- Language
- English
- Academic Unit
- Decision Sciences (and Management Information Systems)
- Web of Science ID
- WOS:000214499200004
- Scopus ID
- 2-s2.0-85011406184
- Other Identifier
- 991019238638204721
UN Sustainable Development Goals (SDGs)
This publication has contributed to the advancement of the following goals:
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Collaboration types
- Domestic collaboration
- Web of Science research areas
- Operations Research & Management Science