A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands (Q1730662)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands |
scientific article; zbMATH DE number 7032662
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands |
scientific article; zbMATH DE number 7032662 |
Statements
A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands (English)
0 references
6 March 2019
0 references
transportation
0 references
routing problems
0 references
city logistics
0 references
exact algorithms
0 references
0 references
0 references
0 references
0 references
0.7793295979499817
0 references
0.773840606212616
0 references
0.76802659034729
0 references
0.7660660743713379
0 references
0.7626467943191528
0 references
