Optimizing dead mileage in urban bus routes through a nondominated solution approach

DOI10.1016/S0377-2217(98)00238-0zbMath0938.90009OpenAlexW2007311731MaRDI QIDQ1124703

Satya Prakash, Deepak Tuteja, B. V. Balaji

Publication date: 25 November 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00238-0

zbMATH Keywords

multiobjective programmingPareto optimaldead mileage

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06)

Related Items

Selection of warehouse sites for clustering ration shops to them with two objectives through a heuristic algorithm incorporating tabu search, A bicriterion call center problem through an evolved branch and bound algorithm, Pareto optimal solutions of a cost-time trade-off bulk transportation problem, 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

Cites Work

• An optimal programme for augmentation of capacities of depots and shipment of buses from depots to starting points of routes
• Selection of optimal site for new depot of specified capacity with two objectives
• A transportation problem with objectives to minimize total cost and duration of transportation
• Unnamed Item
• Unnamed Item
• Unnamed Item