Solution to Chance Constrained Programming Problem in Swap Trailer Transport Organisation based on Improved Simulated Annealing Algorithm
Swap trailer transport organisation problem originates from the traditional vehicle routing problem (VRP). Most of the studies on the problems assume that the travelling times of vehicles are fixed values. In this paper, the uncertainties of driving times are considered and a chance constrained prog...
Uložené v:
| Vydané v: | Applied mathematics and nonlinear sciences Ročník 5; číslo 1; s. 47 - 54 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Beirut
Sciendo
01.01.2020
De Gruyter Brill Sp. z o.o., Paradigm Publishing Services |
| Predmet: | |
| ISSN: | 2444-8656, 2444-8656 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | Swap trailer transport organisation problem originates from the traditional vehicle routing problem (VRP). Most of the studies on the problems assume that the travelling times of vehicles are fixed values. In this paper, the uncertainties of driving times are considered and a chance constrained programming problem is proposed. An improved simulated annealing algorithm is used to solve the problem proposed. The model and algorithm described in this paper are studied through a case study, and the influence of uncertainty on the results is analysed. The conclusion of this study provides theoretical support for the practice of trailer pickup transport. |
|---|---|
| Bibliografia: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 2444-8656 2444-8656 |
| DOI: | 10.2478/amns.2020.1.00005 |