메뉴 건너뛰기




Volumn 15, Issue , 2011, Pages 5284-5289

The vehicle routing problem with simultaneous pickup and delivery based on customer satisfaction

Author keywords

Cheapest insertion method; Tabu search; Vehicle routing problem

Indexed keywords

COMPUTATIONAL RESULTS; INITIAL SOLUTION; INSERTION METHODS; LOWER BOUNDS; PICKUP AND DELIVERY; SERVICE QUALITY; TABU SEARCH ALGORITHMS; TEST INSTANCES; TIME WINDOWS; TOTAL LENGTH; VEHICLE ROUTING PROBLEM; VEHICLE ROUTING PROBLEMS; WAITING-TIME;

EID: 84055222926     PISSN: 18777058     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1016/j.proeng.2011.08.979     Document Type: Conference Paper
Times cited : (44)

References (12)
  • 2
    • 0001407513 scopus 로고
    • Hybrid heuristic for the vehicle routing problem with time windows
    • R A Russell. Hybrid heuristic for the vehicle routing problem with time windows. Transportation Science 1995;29:156-166.
    • (1995) Transportation Science , vol.29 , pp. 156-166
    • Russell, R.A.1
  • 3
    • 0035482443 scopus 로고    scopus 로고
    • A tabu search heuristic for the single vehicle pickup and delivery with time windows
    • A Landrieu, Y Mati, Z Binder. A tabu search heuristic for the single vehicle pickup and delivery with time windows. Journal of Intelligent Manufacturing 2001;12: 497-508.
    • (2001) Journal of Intelligent Manufacturing , vol.12 , pp. 497-508
    • Landrieu, A.1    Mati, Y.2    Binder, Z.3
  • 4
    • 15244361840 scopus 로고    scopus 로고
    • A grouping genetic algorithm for the pickup and delivery problem with time windows
    • G Pankratz. A grouping genetic algorithm for the pickup and delivery problem with time windows. OR Spectrum 2005; 27: 21-41.
    • (2005) OR Spectrum , vol.27 , pp. 21-41
    • Pankratz, G.1
  • 5
    • 79951678318 scopus 로고    scopus 로고
    • A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
    • I Karaoglan, F Altiparmak, I Kara, B Dengiz. A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery. European Journal of Operaional Research 2011;211:318-332.
    • (2011) European Journal of Operaional Research , vol.211 , pp. 318-332
    • Karaoglan, I.1    Altiparmak, F.2    Kara, I.3    Dengiz, B.4
  • 6
    • 0024838030 scopus 로고
    • The multiple vehicle routing problem with simultaneous delivery and pick-up points
    • H Min. The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transportation Research A 1989;23:310-328.
    • (1989) Transportation Research A , vol.23 , pp. 310-328
    • Min, H.1
  • 7
    • 0009605365 scopus 로고
    • PhD thesis, Institute of Mathematical Statistics and Operations Research, Technical University of Denmark, Lyngby
    • K Halse. Modeling and solving complex vehicle routing problems. PhD thesis, Institute of Mathematical Statistics and Operations Research, Technical University of Denmark, Lyngby 1992.
    • (1992) Modeling and Solving Complex Vehicle Routing Problems
    • Halse, K.1
  • 8
    • 8344236786 scopus 로고    scopus 로고
    • Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
    • G Nagy, S Salhi. Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. European Journal of Operaional Research 2005;162:126-141.
    • (2005) European Journal of Operaional Research , vol.162 , pp. 126-141
    • Nagy, G.1    Salhi, S.2
  • 9
    • 33746950313 scopus 로고    scopus 로고
    • Heuristic algorithms for the vehicle problem with simultaneous pick-up and delivery
    • B Nicola, R Giovanni. Heuristic algorithms for the vehicle problem with simultaneous pick-up and delivery. Computers & Operations Research 2007;34:578-594.
    • (2007) Computers & Operations Research , vol.34 , pp. 578-594
    • Nicola, B.1    Giovanni, R.2
  • 12
    • 84055167841 scopus 로고    scopus 로고
    • Research on open vehicle routing problem based on satisfaction of customers
    • W Bin, S Jianfeng, F Yexiang. Research on open vehicle routing problem based on satisfaction of customers. Computer Engineering 2009;35:193-197.
    • (2009) Computer Engineering , vol.35 , pp. 193-197
    • Bin, W.1    Jianfeng, S.2    Yexiang, F.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.