Solving a vehicle routing problem by balancing the vehicles time utilization

Article Abstract:

A heuristic algorithm is developed to find the route of each vehicle to accomplish the visiting of all the demand nodes of the network in the smallest time period. It is found that with the appliance of this method, it is possible to analyze the relation between the number of vehicles and their corresponding cost together with the total covering time of the demand nodes.

Usage, Heuristic programming

---

An exact algorithm for the identical parallel machine scheduling problem

Article Abstract:

The algorithm includes a preprocessing phase, which reformulates the problem and simplifies it. The results show that the proposed algorithm yields optimal solutions in almost all tested cases.

Methods, Problem solving, Business performance management

---

Similar abstracts:

• Abstracts: Vehicle routing problem with time windows and a limited number of vehicles. Problem structuring methods in action
• Abstracts: Cost allocation in the Chinese postman problem. Computing the nucleons of cyclic permutation games. On the nucleolus of neighbor games
• Abstracts: Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches. Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
• Abstracts: Risk transportation via a clique number problem formulation. Exploring inter-organisational relationships in the health service: an immersive drama approach
• Abstracts: Towards an integrated framework for forest fire control. The impact of soft OR-methods on problem structuring

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