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...
Saved in:
| Published in: | Applied mathematics and nonlinear sciences Vol. 5; no. 1; pp. 47 - 54 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Beirut
Sciendo
01.01.2020
De Gruyter Brill Sp. z o.o., Paradigm Publishing Services |
| Subjects: | |
| ISSN: | 2444-8656, 2444-8656 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| Bibliography: | 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 |