Pareto optimal solutions of a cost-time trade-off bulk transportation problem
From MaRDI portal
Publication:2469586
DOI10.1016/j.ejor.2007.03.040zbMath1136.90312OpenAlexW2033998470MaRDI QIDQ2469586
Anuj Gupta, B. V. N. S. Prasad, Pranav Kumar, Satya Prakash
Publication date: 6 February 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.03.040
Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Boolean programming (90C09)
Related Items
Optimizing time–cost trade-off decisions in an interval transportation problem with multiple shipment options, Selection of warehouse sites for clustering ration shops to them with two objectives through a heuristic algorithm incorporating tabu search, The optimization of transportation costs in logistics enterprises with time-window constraints, Bi-criteria transportation problem with multiple parameters, A bicriterion call center problem through an evolved branch and bound algorithm, Pareto optimal solutions providing optimal routes between every two different nodes in the cost-time trade-off routing network without the objectives being prioritized, A cost-time trade-off Königsberg bridge problem traversing all the seven bridges allowing repetition, An approach for analysing transportation costs and a case study, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nondominated solutions of cost-time trade-off transportation and assignment problems
- Optimizing dead mileage in urban bus routes through a nondominated solution approach
- On Sharma-Swarup algorithm for time minimising transportation problems
- A transportation problem with objectives to minimize total cost and duration of transportation
- On minimizing the duration of transportation
- A procedure for time minimization transportation problem
- Technical Note—Cost/Completion-Date Tradeoffs in the Transportation Problem
- An all Zero-One Algorithm for a Certain Class of Transportation Problems
- Some remarks on the time transportation problem
- Time‐minimizing transportation problems
- Communication on “the bottleneck transportation problem” and “some remarks on the time transportation problem”
- An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems
- The bottleneck transportation problem