article · Algorithms
The vehicle-routing problem (VRP) is a popular area of research. This popularity springs from its wide application in many real-world problems, such as logistics, network routing, E-commerce, and various other fields. The VRP is simple to formulate, but very difficult to solve and requires a great deal of time. In these cases, researchers use approximate solutions offered by metaheuristics. This work involved the design of a new metaheuristic called Open Competency Optimization (OCO), which was inspired by human behavior during the learning process and based on the competency approach. The aim is the construction of solutions that represent learners’ ideas in the context of an open problem. The candidate solutions in OCO evolve over three steps. Concerning the first step, each learner builds a path of learning (finding the solution to the problem) through self-learning, which depends on their abilities. In the second step, each learner responds positively to the best ideas in their group (the construction of each group is based on the competency of the learners or the neighbor principle). In the last step, the learners interact with the best one in the group and with the leader. For the sake of proving the relevance of the proposed algorithm, OCO was tested in dynamic vehicle-routing problems along with the Generalized Dynamic Benchmark Generator (GDBG).
This page summarises published work. The authoritative version sits with the publisher.
DOI: 10.3390/a17100449
Is something wrong with this record? Report it or request removal.
Discussion
Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.
No discussion yet. Open the first thread.
New to MARATTO™? Create a free account.