Vehicle routing problem for multiple product types, compartments, and trips with soft time windows (Q1751334)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6873235
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Vehicle routing problem for multiple product types, compartments, and trips with soft time windows |
scientific article; zbMATH DE number 6873235 |
Statements
Vehicle routing problem for multiple product types, compartments, and trips with soft time windows (English)
0 references
25 May 2018
0 references
Summary: This paper presents a mathematical model to solve the vehicle routing problem with soft time windows (VRPSTW) and distribution of products with multiple categories. In addition, we include multiple compartments and trips. Each compartment is dedicated to a single type of product. Each vehicle is allowed to have more than one trip, as long as it corresponds to the maximum distance allowed in a workday. Numerical results show the effectiveness of our model.
0 references
0 references
0 references
0 references
0 references
0 references
0.8078358769416809
0 references
0.7981142997741699
0 references
0.7937026023864746
0 references
0.792914628982544
0 references
0.7925222516059875
0 references
