A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls

Article Abstract:

Research was conducted to examine the two versions of the Vehicle Routing Problem with Backhauls (VRPB), namely the symmetric and the asymmetric versions. The goal is to minimize the total routing cost which is defined as the sum of the costs of the arcs belonging to the K simple circuits in a graph theory model. A cluster-first-route-second heuristic is proposed for the solution of problems with asymmetric cost matrix. Results provide evidence of the effectivity of the proposed model.

Research, Graph theory, Matrices, Matrices (Mathematics)

---

A minimal algorithm for the multiple-choice knapsack problem

Article Abstract:

A minimal algorithm for solving the Multiple-Choice Knapsack Problem (MCKP) is developed. An initial solution first is derived from the Linear Multiple Knapsack Problem. This solution is then integrated into a dynamic programming algorithm to solve the MCKP wherein minimal classes are enumerated, sorted and reduced. Sample applications show that the procedure performs better than other existing algorithms for solving the problem.

Dynamic programming, Combinatorial optimization

---

A unified heuristic for a large class of Vehicle Routing Problems with Backhauls

Article Abstract:

Solution for vehicle routing problem with backhauls is derived, using unified heuristic model.

United States, Management dynamics, Management, Tests, problems and exercises, Company business management, Motor vehicles, Heuristic, Heuristics (Psychology), Vehicle location systems, Route surveying, Backhauling

Similar abstracts:

• Abstracts: A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem. A note of the approximation of the asymmetric traveling salesman problem
• Abstracts: An optimal polynomial time algorithm for the common cycle economic lot and delivery-scheduling problem. Optimal pricing and quantity of products with two offerings
• Abstracts: Stronger K-tree relaxations for the vehicle routing problem. A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
• Abstracts: A multi-level composite heuristic for the multi-depot vehicle fleet mix problem. A heuristic to schedule flexible job-shop in a glass factory
• Abstracts: Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem. Sequential selection procedures: using sample means to improve efficiency

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.