Loading...
Please wait, while we are loading the content...
Similar Documents
An Optimization Algorithm for The Pickup and Delivery Problem With Time Windows
| Content Provider | Semantic Scholar |
|---|---|
| Author | Kang, Jayoung Zang, Hee Jeong Kang, Jangha Park, Sungsoo |
| Copyright Year | 2007 |
| Abstract | The pickup and delivery problem with time windows generally involves the construction of optimal routes which satisfy a set of transportation requests under pairing, precedence, time window, vehicle capacity, and availability constraints. In this paper, we added some constraints to the problem and adopted an objective function based on number of used vehicles, total travel distance and total schedule duration to consider more realistic problems. A branch and price algorithm for the problem is proposed and an enumeration method is used for the subproblems. The algorithm was tested on randomly generated instances and computational results were reported. |
| Starting Page | 33 |
| Ending Page | 43 |
| Page Count | 11 |
| File Format | PDF HTM / HTML |
| Volume Number | 33 |
| Alternate Webpage(s) | http://solab.kaist.ac.kr/files/papers/local_journal/2007_1.pdf |
| Alternate Webpage(s) | http://ocean.kisti.re.kr/downfile/volume/kiie/SGHHB1/2007/v33n1/SGHHB1_2007_v33n1_33.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |