Since assignment problem is a special case of linear programming problem, so you may use one of the well-known heuristic methods for LP. See for example the following paper :
A direct heuristic algorithm for linear programming
April 2012Proceedings Mathematical Sciences 110(1):79-101
DOI: 10.1007/BF02829483.
We want to use 2 vehicles in the same network. Our strategy to combine 2 simple heuristics for example one vehicle should move an item from node A to node B, and the other vehicle should retrieve from node C to D. our strategy wants to first use assigment heuristics to decide which vehicle to do which assignment thereafter, we intend to use traveler problems to solve the roadmap.
By using a simple combination of these heuristic, the vehicle can interact in the same network. we found heuristics but they are more complex for example taboo search, genetic algorithm but we want a simpler heuristic / version because these examples are difficult. We wonder if you can give us tips. Rasheed B. Al-Salih
Note:
1. Decide which autonomous vehicle to perform which assignments (distribute the assignments).
2. Determine for each autonomous vehicle the order in which the mission is to be carried out.
3. Find the fastest route to complete the mission.
if you want exact methods, you can use branch and bound or column generation algorithms.
if you want heuristics, you can use Saving heuristic, sweep heuristic, and others
https://w1.cirrelt.ca/~vidalt/presentations/Minicourse-Odysseus2018.pdf
Article Two Novel Heuristics Based on a New Density Measure for Vehi...
- Badges
- Science topic
- Similar topics
- Engineering
- Petroleum Engineering
- Gas