home scores about PDP CVRPTW history

Li and Lim PDPTW

200 clients

instance routes distance who when solution contributed by
lc1_2_1202704.5678Li&Lim2001-01-01SAM::OPT
lc1_2_2192764.5552Li&Lim2001-01-01SAM::OPT
lc1_2_3173127.7846H2016-07-15
lc1_2_4172693.4088BVH2003-06-27K
lc1_2_5202702.0488Li&Lim2001-01-01SAM::OPT
lc1_2_6202701.0354Li&Lim2001-01-01SAM::OPT
lc1_2_7202701.0354Li&Lim2001-01-01SAM::OPT
lc1_2_8193354.2726SB2018-04-18
lc1_2_9182724.2353Li&Lim2001-01-01SAM::OPT
lc1_2_10172942.1319EOE2015-11-19
lc2_2_161931.4425Li&Lim2001-01-01SAM::OPT
lc2_2_261881.4023Li&Lim2001-01-01SAM::OPT
lc2_2_361844.3281SAM::OPT2003-04-15
lc2_2_461767.1183Li&Lim2001-01-01SAM::OPT
lc2_2_561891.2090Li&Lim2001-01-01SAM::OPT
lc2_2_661857.7772SAM::OPT2003-12-29
lc2_2_761850.1343SAM::OPT2003-12-10
lc2_2_861824.3360Li&Lim2001-01-01SAM::OPT
lc2_2_961854.2104SAM::OPT2003-09-01
lc2_2_1061817.4533Li&Lim2001-01-01SAM::OPT
lr1_2_1204819.1241Li&Lim2001-01-01SAM::OPT
lr1_2_2174621.2058RP22003-07-08K
lr1_2_3144402.3848CLS2016-02-27
lr1_2_4103027.0620SB2018-04-18
lr1_2_5164760.1815BVH2003-06-27Shobb
lr1_2_6134800.9395CLS2016-02-26
lr1_2_7123543.3613SB2018-04-18
lr1_2_892759.3151SB2018-04-18
lr1_2_9135050.7548CLS2016-01-16
lr1_2_10113664.0794H2016-07-13
lr2_2_154073.0980SAM::OPT2003-12-09
lr2_2_243795.9965SAM::OPT2003-02-14
lr2_2_343098.3585RP22003-07-08SAM::OPT
lr2_2_432486.0024H2016-07-13
lr2_2_543438.3917SAM::OPT2003-12-13
lr2_2_634457.9540SCR2019-11-06
lr2_2_733098.3541H2016-07-15
lr2_2_822449.3617SCR2019-11-06
lr2_2_933922.1105SB2018-04-18
lr2_2_1033254.8263SB2018-04-18
lrc1_2_1193606.0626SAM::OPT2003-12-14
lrc1_2_2153671.0239EOE2015-11-19
lrc1_2_3133154.9222CLS2016-02-27
lrc1_2_4102631.8190RP22003-07-08K
lrc1_2_5163715.8094BVH2003-06-27SAM::OPT
lrc1_2_6163572.1589EOE2015-11-19
lrc1_2_7143666.3394K2015-04-13
lrc1_2_8133145.7400CVB2018-04-06
lrc1_2_9133157.3388EOE2015-11-19
lrc1_2_10122928.9036EOE2015-11-19
lrc2_2_163595.1783K2015-04-14
lrc2_2_253158.2501H2016-07-13
lrc2_2_342881.9865H2016-07-13
lrc2_2_432835.4049SCR2019-11-06
lrc2_2_552776.9262BVH2003-06-27SAM::OPT
lrc2_2_652707.9592SAM::OPT2003-12-21
lrc2_2_743010.6763SCR2019-11-06
lrc2_2_842399.8904EOE2015-11-17
lrc2_2_942208.4949RP22003-07-08SAM::OPT
lrc2_2_1032437.8805H2016-07-13

400 clients

instance routes distance who when solution contributed by
lc1_4_1407152.0566SAM::OPT2003-06-16
lc1_4_2388007.7853Q2015-10-08
lc1_4_3328678.2293SCR2019-11-06
lc1_4_4306451.6800LL2001-01-01
lc1_4_5407149.9962SAM::OPT2003-04-19
lc1_4_6407154.0159Li&Lim2001-01-01SAM::OPT
lc1_4_7407149.4345SAM::OPT2003-03-15
lc1_4_8388305.4246CVB22019-01-17
lc1_4_9367451.1989Q2015-10-09
lc1_4_10347850.2241SCR2019-11-06
lc2_4_1124116.3291Li&Lim2001-01-01SAM::OPT
lc2_4_2124144.2890SAM::OPT2003-05-15
lc2_4_3124401.0810CVB22019-01-17
lc2_4_4123743.9500Li&Lim2001-01-01
lc2_4_5124030.6341TS2003-05-01SAM::OPT
lc2_4_6123900.2855SAM::OPT2003-04-20
lc2_4_7123962.5070BVH2003-06-27SAM::OPT
lc2_4_8123844.4523Li&Lim2001-01-01SAM::OPT
lc2_4_9124188.9281RP22003-07-08Shobb
lc2_4_10123828.4359BVH2003-06-27SAM::OPT
lr1_4_14010639.7539TS2003-01-01SAM::OPT
lr1_4_23011009.5077SB2019-01-30
lr1_4_3229245.4837HW2020-12-01
lr1_4_4157007.8982HW2021-06-12
lr1_4_52811374.0641CLS2016-01-23
lr1_4_62311334.1112HW2020-12-01
lr1_4_7188675.3602SCR2019-11-06
lr1_4_8136164.8222SCR2021-12-21
lr1_4_9249859.4655SCR2019-11-06
lr1_4_10208192.6546SCR2019-11-06
lr2_4_189726.8819BVH2003-06-27SAM::OPT
lr2_4_279405.4012SCR2019-11-06
lr2_4_3510176.9397SCR2021-12-21
lr2_4_446201.8431SCR2019-11-06
lr2_4_569894.4593HW2021-06-12
lr2_4_658946.9096SCR2019-11-06
lr2_4_747993.1580SCR2020-12-02
lr2_4_845260.4193SCR2020-12-02
lr2_4_967926.0702SCR2019-11-06
lr2_4_1057596.6238SCR2019-11-06
lrc1_4_1369124.5172CLS2015-12-02
lrc1_4_2318346.0614RP22003-07-08SB
lrc1_4_3247805.1637SB2019-01-30
lrc1_4_4195803.3125SB2019-01-30
lrc1_4_5328847.4010SB2019-01-30
lrc1_4_6308394.4674SCR2019-11-06
lrc1_4_7288037.8690DK2011-06-30
lrc1_4_8267930.1453SB2019-01-30
lrc1_4_9258004.2380SCR2019-11-06
lrc1_4_10237064.3626SCR2019-05-16
lrc2_4_1119738.9463SCR2019-11-06
lrc2_4_2107159.9487SB2019-01-30
lrc2_4_386426.4656SCR2019-11-06
lrc2_4_455238.7692SCR2019-11-06
lrc2_4_5107309.5386SCR2019-11-06
lrc2_4_696337.0781Q2016-01-21
lrc2_4_786292.2344SCR2019-11-06
lrc2_4_875767.7172SCR2019-11-06
lrc2_4_966272.9191SCR2019-11-06
lrc2_4_1065395.7052SCR2021-12-21

600 clients

instance routes distance who when solution contributed by
lc1_6_16014095.6438RP22003-07-14Shobb
lc1_6_25715048.1606CLS2016-01-13
lc1_6_34914874.6766SCR2020-03-31
lc1_6_44713300.5481HW2021-06-12
lc1_6_56014086.3016Li&Lim2001-01-01SAM::OPT
lc1_6_66014090.7906RP22003-07-14SAM::OPT
lc1_6_76014083.7563SAM::OPT2003-07-13
lc1_6_85814880.6996CLS2015-12-08
lc1_6_95315207.5760SCR2020-01-21
lc1_6_105115432.5486SCR2021-12-21
lc2_6_1197977.9754SAM::OPT2003-07-14
lc2_6_2189900.4846SCR2020-01-21
lc2_6_3178512.9414SCR2020-12-02
lc2_6_4177860.3824SCR2019-11-06
lc2_6_5189051.5286CVB22019-01-17
lc2_6_6188775.5460SCR2019-11-06
lc2_6_7189376.5825SCR2019-11-06
lc2_6_8187579.9262RP22003-07-14Q
lc2_6_9188714.2238SCR2021-12-21
lc2_6_10177946.6021SCR2019-11-06
lr1_6_15922821.6527CLS2017-03-17
lr1_6_24520137.2178SB2019-01-30
lr1_6_33717846.1700SCR2019-11-06
lr1_6_42813127.5603SCR2019-11-06
lr1_6_53723623.5155HW2021-03-02
lr1_6_63023084.5032SCR2021-12-21
lr1_6_72416963.3726SCR2021-04-26
lr1_6_81811917.7017SCR2021-12-21
lr1_6_93121835.8698SCR2019-11-06
lr1_6_102519298.2466SCR2021-12-21
lr2_6_11121759.3306SB2019-01-30
lr2_6_2921289.7012HW2021-03-02
lr2_6_3717480.0597SCR2021-04-26
lr2_6_4610639.0761SCR2019-11-06
lr2_6_5822625.8932HW2021-03-02
lr2_6_6719099.4890SCR2020-12-02
lr2_6_7614645.3164SCR2021-12-21
lr2_6_8412341.8995SCR2021-12-21
lr2_6_9818259.1969SCR2019-11-06
lr2_6_10716390.6427SCR2019-11-06
lrc1_6_15218288.8950SB2019-01-30
lrc1_6_24316515.4064SB2019-01-30
lrc1_6_33613975.9760SCR2019-11-06
lrc1_6_42510800.4446SCR2019-11-06
lrc1_6_54517463.9352HW2020-12-01
lrc1_6_64119025.3635HW2020-12-01
lrc1_6_73715914.8525HW2020-12-01
lrc1_6_83315317.6290SCR2019-11-06
lrc1_6_93315344.6389HW2020-12-01
lrc1_6_102913963.6628SCR2019-11-06
lrc2_6_11614578.9221SCR2019-11-06
lrc2_6_21313850.2169SCR2019-11-06
lrc2_6_31012432.9089SCR2019-11-06
lrc2_6_479833.9252SCR2019-11-06
lrc2_6_51314380.3652HW2020-12-08
lrc2_6_61214962.0824HW2020-12-01
lrc2_6_71014094.2635HW2020-12-03
lrc2_6_8913179.5794SCR2021-12-21
lrc2_6_9816309.7754SCR2021-12-21
lrc2_6_10713054.5015SCR2019-11-06

800 clients

instance routes distance who when solution contributed by
lc1_8_18025184.3826SAM::OPT2003-06-16
lc1_8_27629735.8486HW2021-03-02
lc1_8_36227287.7990SCR2021-12-21
lc1_8_45922686.0848SCR2020-01-21
lc1_8_58025211.2241SAM::OPT2003-07-12
lc1_8_68025164.2534SAM::OPT2003-07-12
lc1_8_78025158.3790SAM::OPT2003-07-13
lc1_8_87726688.1709HW2020-12-01
lc1_8_97126975.6108SCR2021-12-21
lc1_8_106827099.5923SCR2021-12-21
lc2_8_12411687.0563SAM::OPT2003-05-19
lc2_8_22413713.1334SB2019-01-30
lc2_8_32412981.3694SCR2019-11-06
lc2_8_42312917.3406HW2021-01-16
lc2_8_52512298.3297EOE2016-05-09
lc2_8_62412645.7083SB2019-01-30
lc2_8_72414041.4736SCR2021-12-21
lc2_8_82312924.1013SCR2021-12-21
lc2_8_92411629.4102CLS2015-11-29
lc2_8_102312226.4219SCR2019-11-06
lr1_8_18039291.3198CVB2018-04-06
lr1_8_25934071.1897NVIDIA2024-02-02
lr1_8_34429223.0998NVIDIA2024-02-02
lr1_8_42520675.6955SCR2021-12-21
lr1_8_54839809.6803SCR2021-12-21
lr1_8_63836244.9032SCR2021-12-21
lr1_8_73027078.0889SCR2021-12-21
lr1_8_81920705.4512SCR2021-12-21
lr1_8_93938498.9968SCR2021-12-21
lr1_8_103031091.0696SCR2021-12-21
lr2_8_11441873.1217HW2020-12-01
lr2_8_21136549.6934HW2020-12-24
lr2_8_3926391.0683SCR2021-04-26
lr2_8_4620618.0349SCR2021-12-21
lr2_8_51134816.4985SCR2021-04-26
lr2_8_6928814.6504HW2021-01-16
lr2_8_7725502.3873SCR2021-12-21
lr2_8_8518327.2320SCR2021-04-26
lr2_8_91030515.4950SCR2019-11-06
lr2_8_10830136.8618HW2021-01-16
lrc1_8_16632252.2783CVB22019-01-17
lrc1_8_25627878.8912CAINIAO2020-03-13
lrc1_8_34824371.9460SB2019-01-30
lrc1_8_43418208.5136SCR2020-12-02
lrc1_8_55831169.1609SCR2019-11-06
lrc1_8_65428961.6569HW2020-12-01
lrc1_8_75028768.3951SCR2021-12-21
lrc1_8_84426902.9309SCR2020-01-21
lrc1_8_94424854.9631SCR2021-12-21
lrc1_8_103924622.5870SCR2021-12-21
lrc2_8_12023074.2155CVB22019-01-17
lrc2_8_21722220.9497SCR2019-11-06
lrc2_8_31420379.2584SCR2019-11-06
lrc2_8_41114711.7976SCR2021-12-21
lrc2_8_51623602.4356CAINIAO2020-04-08
lrc2_8_61522591.2594SCR2019-11-06
lrc2_8_71325436.7909HW2020-12-01
lrc2_8_81122604.3608HW2021-01-16
lrc2_8_91022594.6860SCR2021-12-21
lrc2_8_10919604.1227SCR2021-12-21

1000 clients

instance routes distance who when solution contributed by
lc1_10_110042488.6570SAM::OPT2003-04-23
lc1_10_29444548.5117SB2019-01-30
lc1_10_37845906.3018SCR2021-12-21
lc1_10_47237782.1652SCR2021-12-21
lc1_10_510042477.4137SAM::OPT2003-08-10
lc1_10_610142838.3948SAM::OPT2003-08-11
lc1_10_710042854.9853TS2003-01-01SAM::OPT
lc1_10_89842949.5645Shobb2018-03-31
lc1_10_99043564.0149SCR2021-12-21
lc1_10_108642929.1538SCR2021-12-21
lc2_10_13016879.2419TS2003-01-01SAM::OPT
lc2_10_23020764.0938SCR2021-12-21
lc2_10_32919299.4838SCR2021-12-21
lc2_10_42917886.9744SCR2019-11-06
lc2_10_53117137.5280RP22005-02-25K
lc2_10_63019387.7458SCR2021-12-21
lc2_10_73118389.3693SCR2019-11-06
lc2_10_83017015.0291SB2019-01-30
lc2_10_93018225.3026SCR2019-11-06
lc2_10_102917043.6421SCR2019-11-06
lr1_10_110056744.9118EMIF2018-08-22
lr1_10_28049349.8412SCR2019-11-06
lr1_10_35441483.8892SCR2021-12-21
lr1_10_42730788.1088NVIDIA2024-02-02
lr1_10_55859053.6768NVIDIA2023-03-08
lr1_10_64651058.5279NVIDIA2024-02-02
lr1_10_73538563.1965HW2021-06-12
lr1_10_82429613.2681SCR2021-12-21
lr1_10_94754582.2490SCR2021-12-21
lr1_10_103845510.7058SCR2021-12-21
lr2_10_11762859.2910SCR2021-12-21
lr2_10_21451357.3044SCR2021-04-26
lr2_10_31042908.3328SCR2021-12-21
lr2_10_4826595.3914SCR2021-04-26
lr2_10_51354951.1206NVIDIA2024-02-02
lr2_10_61146253.3748SCR2021-12-21
lr2_10_7839648.5445SCR2021-12-21
lr2_10_8626742.3089NVIDIA2024-02-02
lr2_10_91250781.8317NVIDIA2023-02-22
lr2_10_101044888.9910SCR2021-12-21
lrc1_10_18249111.7830SB2019-01-30
lrc1_10_27145547.3838HW2020-12-01
lrc1_10_35335616.8499SCR2021-12-21
lrc1_10_44027211.8738SCR2021-12-21
lrc1_10_57250323.0431HW2021-03-02
lrc1_10_66745115.2217HW2020-12-01
lrc1_10_76041560.5216HW2020-12-24
lrc1_10_85540770.0983SCR2021-12-21
lrc1_10_95240934.2660SCR2021-12-21
lrc1_10_104736539.0333SCR2021-12-21
lrc2_10_12234463.4648SCR2019-11-06
lrc2_10_21938619.1328HW2020-12-11
lrc2_10_31627218.0784HW2020-12-24
lrc2_10_41123212.4570SCR2021-12-21
lrc2_10_51640638.1286SCR2021-12-21
lrc2_10_61730910.6526SCR2019-11-06
lrc2_10_71533275.2411SCR2020-01-21
lrc2_10_101129085.2825SCR2021-12-21

100 clients

instance routes distance who when solution contributed by
lc10110828.9369Li&Lim2001-01-01SAM::OPT
lc10210828.9369Li&Lim2001-01-01SAM::OPT
lc10391035.3499BVH2003-06-27SAM::OPT
lc1049860.0112SAM::OPT2003-04-11
lc10510828.9369Li&Lim2001-01-01SAM::OPT
lc10610828.9369Li&Lim2001-01-01SAM::OPT
lc10710828.9369Li&Lim2001-01-01SAM::OPT
lc10810826.4392Li&Lim2001-01-01SAM::OPT
lc10991000.5962BVH2003-06-27Q
lc2013591.5566Li&Lim2001-01-01SAM::OPT
lc2023591.5566Li&Lim2001-01-01SAM::OPT
lc2033591.1734SAM::OPT2003-03-11
lc2043590.5987SAM::OPT2003-03-08
lc2053588.8760Li&Lim2001-01-01SAM::OPT
lc2063588.4928Li&Lim2001-01-01SAM::OPT
lc2073588.2863Li&Lim2001-01-01SAM::OPT
lc2083588.3238Li&Lim2001-01-01SAM::OPT
lr101191650.7992Li&Lim2001-01-01SAM::OPT
lr102171487.5704Li&Lim2001-01-01SAM::OPT
lr103131292.6755Li&Lim2001-01-01SAM::OPT
lr10491013.3893Li&Lim2001-01-01SAM::OPT
lr105141377.1110Li&Lim2001-01-01SAM::OPT
lr106121252.6167Li&Lim2001-01-01SAM::OPT
lr107101111.3132Li&Lim2001-01-01SAM::OPT
lr1089968.9660Li&Lim2001-01-01SAM::OPT
lr109111208.9648SAM::OPT2003-02-27
lr110101159.3484Li&Lim2001-01-01SAM::OPT
lr111101108.9007Li&Lim2001-01-01SAM::OPT
lr11291003.7670Li&Lim2001-01-01SAM::OPT
lr20141253.2340SAM::OPT2003-02-28
lr20231197.6655Li&Lim2001-01-01SAM::OPT
lr2033949.3964Li&Lim2001-01-01SAM::OPT
lr2042849.0504Li&Lim2001-01-01SAM::OPT
lr20531054.0186Li&Lim2001-01-01SAM::OPT
lr2063931.6254Li&Lim2001-01-01SAM::OPT
lr2072903.0556Li&Lim2001-01-01SAM::OPT
lr2082734.8480Li&Lim2001-01-01SAM::OPT
lr2093930.5857SAM::OPT2003-03-09
lr2103964.2236Li&Lim2001-01-01SAM::OPT
lr2112911.5183SAM::OPT2003-05-15
lrc101141708.8013Li&Lim2001-01-01SAM::OPT
lrc102121558.0693SAM::OPT2003-02-19
lrc103111258.7371Li&Lim2001-01-01SAM::OPT
lrc104101128.4012Li&Lim2001-01-01SAM::OPT
lrc105131637.6244Li&Lim2001-01-01SAM::OPT
lrc106111424.7337SAM::OPT2003-02-28
lrc107111230.1448SAM::OPT2003-02-18
lrc108101147.4253SAM::OPT2003-02-28
lrc20141406.9401SAM::OPT2003-02-28
lrc20231374.2668Li&Lim2001-01-01SAM::OPT
lrc20331089.0677Li&Lim2001-01-01SAM::OPT
lrc2043818.6631SAM::OPT2003-03-23
lrc20541302.1985Li&Lim2001-01-01SAM::OPT
lrc20631159.0332SAM::OPT2003-03-12
lrc20731062.0483SAM::OPT2004-01-04
lrc2083852.7576Li&Lim2001-01-01SAM::OPT

references

B
O. Bräysy "A Reactive Variable Neighborhood Search Algorithm for the Vehicle Routing Problem with Time Windows," Working Paper, University of Vaasa, Finland, 2001.
BBM
Baldacci, Bartolini, and Mingozzi An Exact Algorithm for the Pickup and Delivery Problem. Operations Research 59(2), pp. 414–426 (2011).
BC4
Mirosław Błocho, Zbigniew J. Czech "A parallel memetic algorithm for the vehicle routing problem with time windows". 3PGCIC 2013, 8th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing.
BS
Pete Bailey, Paul Smith (IFS 360 Scheduling) Commercial Software (www.360scheduling.com)
BSJ
Bjørn Sigurd Johansen, BjornSigurdJohansen@hotmail.com DSolver 09-2004
BSJ2
Bjørn Sigurd Johansen, BjornSigurdJohansen@hotmail.com DSolver version2 05-2005.
BVH
R. Bent and P. Van Hentenryck "A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows," Technical Report CS-01-06, Department of Computer Science, Brown University, 2001.
CAINIAO
Zhu He, Longfei Wang, Haoyuan Hu (haoyuan.huhy@cainiao.com), Yinghui Xu & VRP Team (Yujie Chen, Lei Wen, Guotao Wu, Ying Zhang et al.), unpublished result of CAINIAO AI. "New Algorithm for PDPTW", unpublished result of CAINIAO AI.
Zhu He, Longfei Wang, Weibo Lin, Yujie Chen, Haoyuan Hu (haoyuan.huhy@cainiao.com), Yinghui Xu & VRP Team (Ying Zhang, Guotao Wu, Kunpeng Han et al.), unpublished result of CAINIAO AI. "New Algorithm for VRPTW", unpublished result of CAINIAO AI.
CLS
Curtois & Landa Silva Ejection based metaheuristic for PDPTW. Working paper, University of Nottingham
CVB
Christiaens J. and Vanden Berghe G. A Fresh Ruin & Recreate Implementation for Capacitated Vehicle Routing Problems. To be submitted.
CVB2
Christiaens J. and Vanden Berghe G. Preliminary title: Slack Induction by String Removals for Vehicle Routing Problems.
DK
Dirk Koning Using Column Generation for the Pickup and Delivery Problem with Disturbances, Technical Report, Department of Computer Science, Utrecht University, 2011.
EMIF
Evgeny Makarov, Ilya Fiks (swatmobile.io) swatmobile.io
EOE
Eirik Krogen Hagen, EOE Koordinering DA "Exploring infeasible and feasible regions of the VRPTW and PDPTW through penalty based tabu search". Working paper.
G
Tomasz Gandor "Approximate Solutions for the Vehicle Routing Problem with Time Windows for a Large Number of Customers". "Systemy Wspomagania Decyzji" (Decision Support Systems), 2008, Zakopane, Poland.
GH
H. Gehring and J. Homberger "A Parallel Two-phase Metaheuristic for Routing Problems with Time Windows," Asia-Pacific Journal of Operational Research, 18, 35-47, (2001).
H
Keld Helsgaun Unpublished Technical Report, Roskilde University, 2017.
JG
Jakub Grzegorek Improved Hybrid Genetic Search with Advanced Diversity Control, forthcoming MEng thesis, Imperial College London. (2017)
JN
Jakub Nalepa "Parallel memetic algorithm to solve the vehicle routing problem with time windows, Master of Science Thesis, Silesian University of Technology, Gliwice, 2011"
JNMB
Jakub Nalepa, Miroslaw Blocho. "Co-operation in the Parallel Memetic Algorithm", International Journal of Parallel Programming 214, pp 1-28. http://dx.doi.org/10.1007/s10766-014-0343-4
JNMB2
Jakub Nalepa, Miroslaw Blocho. "Temporally Adaptive Co-operation Schemes". working paper.
K
Richard Kelly Hybrid Ejection Chains and Adaptive LNS for the PDPTW. Working paper.
Li&Lim
Li H. and A. Lim A MetaHeuristic for the Pickup and Delivery Problem with Time Windows, In Proceedings of the 13th International Conference on Tools with Artificial Intelligence, Dallas, TX, USA, 2001.
LL
H. Li and A. Lim "Large Scale Time-Constrained Vehicle Routing Problems: A General Metaheuristic Framework with Extensive Experimental Results," Submitted to Artificial Intelligence Review, 2001.
M
D. Mester "An Evolutionary Strategies Algorithm for Large Scale Vehicle Routing Problem with Capacitate and Time Windows Restrictions," Working Paper, Institute of Evolution, University of Haifa, Israel (2002).
MB
Mester, D. and O. Bräysy "Active Guided Evolution Strategies for Large Scale Vehicle Routing Problems with Time Windows". Computers & Operations Research 32, 1593-1614. (2005)
MB2
Mester, D. and O. Bräysy "A new powerful metaheuristic for the VRPTW", working paper, University of Haifa, Israel (2012).
MBD
D. Mester, O. Bräysy and W. Dullaert "A Multi-parametric Evolution Strategies Algorithm for Vehicle Routing Problems". Working Paper, Institute of Evolution, University of Haifa, Israel (2005).
MFS
Evgeny Makarov, Ilya Fiks, Eugene Sorokhtin (swatmobile.io) swatmobile.io
MK
M. Koch "An approach combining two methods for the vehicle routing problem with time windows", The solutions were presented at EURO and EURO XX Conference 2004.
NB
Jakub Nalepa, Mirosław Błocho Co-operation in the parallel memetic algorithm, submitted to International Journal of Parallel Programming
NB1
J. Nalepa and M. Blocho "Enhanced Guided Ejection Search for the Pickup and Delivery Problem with Time Windows" Intelligent Information and Database Systems: Proc. 8th Asian Conference, ACIIDS 2016, pages 388–398. Springer, Heidelberg, 2016.
NBC
Jakub Nalepa, Miroslaw Blocho, and Zbigniew J. Czech. "Co-operation schemes for the parallel memetic algorithm". In Roman Wyrzykowski, Jack Dongarra, Konrad Karczewski, and Jerzy Waniewski, editors, Parallel Processing and Applied Mathematics, Lecture Notes in Computer Science, pages 191–201. Springer Berlin Heidelberg, 2014. ISBN 978-3-642-55223-6. doi: 10.1007/978-3-642-55224-3 19.
NBD
Yuichi Nagata, Olli Bräysy, and Wout Dullaert (2010) "A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows". Comput. Oper. Res. 37, 4 (April 2010), 724-737.
NVIDIA
Piotr Sielski, Akif Çördük, Nicolas Blin, Hugo Linsenmaier, Alex Fender, Rajesh Gandham NVIDIA
PGDR
Eric Prescott-Gagnon, Guy Desaulniers and Louis-Martin Rousseau A Branch-and-Price-Based Large Neighborhood Search Algorithm for the Vehicle Routing Problem with Time Windows. (2007).
Q
Quintiq http://www.quintiq.com/optimization/vrptw-world-records.html
RC
Ropke S. and J.-F. Cordeau Branch and cut and price for the pickup and delivery problem with time windows. Transportation Sci. 43(3)267–286 (2009).
RP
S. Ropke & D. Pisinger An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows, Technical Report, Department of Computer Science, University of Copenhagen, 2004.
RP2
S. Ropke & D.Pisinger "A general heuristic for vehicle routing problems", technical report, Department of Computer Science, University of Copenhagen.
SAM::OPT
Geir Hasle, Oddvar Kloster Industrial Vehicle Routing Problems. Chapter in Hasle G., K-A Lie, E. Quak (eds): Geometric Modelling, Numerical Simulation, and Optimization. ISBN 978-3-540-68782-5, Springer 2007
SB
Carlo Sartori, Luciana Buriol A matheuristic approach to the PDPTW (to be submitted).
SCR
Piotr Sielski (piotr.sielski@wmii.uni.lodz.pl), Piotr Cybula, Marek Rogalski (marek.rogalski@wmii.uni.lodz.pl), Mariusz Kok, Piotr Beling, Andrzej Jaszkiewicz, Przemysław Pełka. Emapa S.A. (http://www.emapa.pl). "New methods of VRP problem optimization", unpublished result, research funded by The National Centre for Research and Development. "New methods of VRP problem optimization", project number: POIR.01.01.01.-00-0222/16.
Piotr Sielski (piotr.sielski@wmii.uni.lodz.pl), Piotr Cybula, Marek Rogalski (marek.rogalski@wmii.uni.lodz.pl), Mariusz Kok, Piotr Beling, Andrzej Jaszkiewicz, Przemysław Pełka. Emapa S.A. (http://www.emapa.pl). "Development of universal methods of solving advanced VRP problems with the use of machine learning", unpublished research funded by The National Centre for Research and Development, project number: POIR.01.01.01-00-0012/19. "Optimization of advanced VRP problem variants", unpublished. Computing grant 358 funded by Poznan Supercomputing and Networking Center.
Shobb
Shobb http://shobb.narod.ru/vrppd.html
TS
TetraSoft A/S MapBooking Algoritm for Pickup and Delivery Solutions with Time Windows and Capacity restraints.
VCGP
T. Vidal, T. G. Crainic, M. Gendreau, C. Prins 'A hybrid genetic algorithm with adaptive diversity managment for a large class of vehicle routing problems with time-windows'
VR
Dmitriy Demin, Mikhail Diakov (msd@veeroute.com), Ivan Ilin, Nikita Ivanov, Viacheslav Sokolov (vs@veeroute.com) et al. VRt Global (https://veeroute.com/) veeroute.com
WA
Ruud Wagemaker MSc thesis in progress. Tilburg University.
WM
Ganzhong Luo (luoganzhong@water-mirror.com), Lei Gao (gaolei@water-mirror.com), Zhixin Liu, Yaning Li, Mingxiang Chen, Qichang Chen, Nuoyi Zhu, unpublished result of WATERMIRROR AI. "New Algorithms for VRPTW & PDPTW", unpublished result of WATERMIRROR AI.
OT
Piotr Sielski, Piotr Cybula, Marek Rogalski (marek.rogalski@otimo.pro), Mariusz Kok, Przemysław Pełka, Krzysztof Chaładyn. Otimo (https://otimo.pro)
WW
Witoslaw Wierzbicki "Design and implementation of parallel programs with shared memory". Master of Science Thesis, University of Silesia, Sosnowiec, 2012.