| Attributs | Valeurs |
|---|
| type
| |
| Is Part Of
| |
| Subject
| |
| Title
| - New Notation and Classification Scheme for Vehicle Routing Problems
|
| Date
| |
| has manifestation of work
| |
| related by
| |
| Author
| |
| Abstract
| - Vehicle Routing Problems have been some of the most studied problems in combinatorial optimisation because they have many applications in transportation and supply chain. They are usually known as Vehicle Routing Problems or VRPs. The related literature is quite large and diverse both in terms of variants of the problems and in terms of solving approaches. To identify the different variants of routing problems, authors generally use initialisms, in which various prefixes and suffixes indicate the presence of different assumptions or constraints. But this identification based on initialisms is inefficient. For example, two variants of a problem may be identified by the same abbreviation, whereas different abbreviations may be assigned to the same problem. This paper proposes a new notation and a new formalism to identify and to classify instances of routing problems. This contribution aims at filling in the gaps of the current identification system. The goal is to allow everyone to position his work accurately in the literature, and to easily identify approaches and results comparable to his research. The proposed notation is inspired by the scheduling formalism. It has four fields ( π/ α/ β/ γ), respectively describing the type and horizon of the problem, the system structure, resources and demands, constraints and objectives to be optimized. 26 papers from the literature chosen for their disparity are classified using this notation to illustrate its usefulness and a software tool is proposed to make its use easier.
|
| article type
| |
| publisher identifier
| |
| Date Copyrighted
| |
| Rights
| - © EDP Sciences, ROADEF, SMAI 2014
|
| Rights Holder
| |
| is part of this journal
| |
| is primary topic
of | |
