Solving fixed charge transportation problem with truck load constraint using metaheuristics

DOI10.1007/s10479-017-2692-zzbMath1434.90013OpenAlexW2765338005MaRDI QIDQ1730658

J. Mukund Nilakantan, N. Jawahar, S. G. Ponnambalam, A. N. Balaji, Izabela Ewa Nielsen

Publication date: 6 March 2019

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-017-2692-z

zbMATH Keywords

heuristicssimulated annealing algorithmgenetic algorithmtransportation problemfixed chargetruck load capacity

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

A solution technique for capacitated two-level hierarchical time minimization transportation problem ⋮ An uncertain two-echelon fixed charge transportation problem ⋮ An iterative solution technique for capacitated two-stage time minimization transportation problem

Cites Work

• Unnamed Item
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
• Design and implementation of a decision support system for multistage investment in Chinese coal production and transportation
• Use of penalties in a branch and bound procedure for the fixed charge transportation problem
• A simulated annealing algorithm for a two-stage fixed charge distribution problem of a supply chain
• A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge
• The interactive fixed charge inhomogeneous flows optimization problem
• A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
• A tabu search heuristic procedure for the fixed charge transportation problem
• A genetic algorithm for solving the fixed-charge transportation model: two-stage problem
• A bilevel fixed charge location model for facilities under imminent attack
• Solving fixed charge transportation problem with interval parameters
• Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach
• A genetic algorithm for the vehicle routing problem
• A simple and effective evolutionary algorithm for the vehicle routing problem
• Genetic algorithms for the traveling salesman problem
• Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
• A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• An improved ant colony optimization for vehicle routing problem
• Algorithms for solving the single-sink fixed-charge transportation problem
• Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation
• A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
• A branch-and-bound algorithm for solving fixed charge problems
• The pure fixed charge transportation problem
• Successive Linear Approximation Procedure for Generalized Fixed-Charge Transportation Problems
• A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
• Fast Algorithms for Single-Sink Fixed Charge Transportation Problems with Applications to Manufacturing and Transportation
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Solving the Fixed Charge Problem by Ranking the Extreme Points
• A Branch-and-Bound Method for the Fixed Charge Transportation Problem
• Planning and coordination of production and distribution facilities for multiple commodities

This page was built for publication: Solving fixed charge transportation problem with truck load constraint using metaheuristics