Adaptive guided ejection search for pickup and delivery with time windows

[1]  Maged M. Dessouky,et al.  A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows , 2006, Eur. J. Oper. Res..

[2]  J. Wesley Barnes,et al.  Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search Transportation , 2000 .

[3]  W. Krzanowski,et al.  A Criterion for Determining the Number of Groups in a Data Set Using Sum-of-Squares Clustering , 1988 .

[4]  Michel Gendreau,et al.  A review of dynamic vehicle routing problems , 2013, Eur. J. Oper. Res..

[5]  Malika Charrad,et al.  NbClust: An R Package for Determining the Relevant Number of Clusters in a Data Set , 2014 .

[6]  Michalis Vazirgiannis,et al.  Clustering validity assessment: finding the optimal partitioning of a data set , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[7]  Donald W. Bouldin,et al.  A Cluster Separation Measure , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Jakub Nalepa,et al.  A Parallel Algorithm with the Search Space Partition for the Pickup and Delivery with Time Windows , 2015, 2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC).

[9]  Bruce L. Golden,et al.  The period vehicle routing problem: New heuristics and real-world variants , 2011 .

[10]  Jirí Vokrínek,et al.  Parallel solver for vehicle routing and pickup and delivery problems with time windows based on agent negotiation , 2012, 2012 IEEE International Conference on Systems, Man, and Cybernetics (SMC).

[11]  Jakub Nalepa,et al.  Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows , 2016, Soft Comput..

[12]  G. W. Milligan,et al.  A monte carlo study of thirty internal criterion measures for cluster analysis , 1981 .

[13]  Fionn Murtagh,et al.  Ward’s Hierarchical Agglomerative Clustering Method: Which Algorithms Implement Ward’s Criterion? , 2011, Journal of Classification.

[14]  L. Hubert,et al.  Measuring the Power of Hierarchical Cluster Analysis , 1975 .

[15]  Hoong Chuin Lau,et al.  Pickup and Delivery with Time Windows: Algorithms and Test Case Generation , 2002, Int. J. Artif. Intell. Tools.

[16]  F. Marriott.  Practical problems in a method of cluster analysis. , 1971, Biometrics.

[17]  Giovanni Righini,et al.  A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows , 2014, Math. Program. Comput..

[18]  G. W. Milligan,et al.  An examination of procedures for determining the number of clusters in a data set , 1985 .

[19]  Roberto Baldacci,et al.  An Exact Algorithm for the Pickup and Delivery Problem with Time Windows , 2011, Oper. Res..

[20]  Jean-François Cordeau,et al.  A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..

[21]  H. P. Friedman,et al.  On Some Invariant Criteria for Grouping Data , 1967 .

[22]  Jakub Nalepa,et al.  Co-operation in the Parallel Memetic Algorithm , 2014, International Journal of Parallel Programming.

[23]  Jakub Nalepa,et al.  How to Generate Benchmarks for Rich Routing Problems? , 2016, ACIIDS.

[24]  Geoffrey H. Ball,et al.  ISODATA, A NOVEL METHOD OF DATA ANALYSIS AND PATTERN CLASSIFICATION , 1965 .

[25]  Roberto Roberti,et al.  Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints , 2012, Eur. J. Oper. Res..

[26]  Jakub Nalepa,et al.  Adaptive memetic algorithm enhanced with data geometry analysis to select training data for SVMs , 2016, Neurocomputing.

[27]  Jakub Nalepa,et al.  Enhanced Guided Ejection Search for the Pickup and Delivery Problem with Time Windows , 2016, ACIIDS.

[28]  J. Dunn.  Well-Separated Clusters and Optimal Fuzzy Partitions , 1974 .

[29]  Jakub Nalepa,et al.  Texture Analysis for Identifying Heterogeneity in Medical Images , 2014, ICCVG.

[30]  Lucio Grandinetti,et al.  The Multi-objective Multi-vehicle Pickup and Delivery Problem with Time Windows , 2014 .

[31]  Gilbert Laporte,et al.  A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading , 2014, Comput. Oper. Res..

[32]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[33]  T. Caliński,et al.  A dendrite method for cluster analysis , 1974 .

[34]  A. Scott,et al.  Clustering methods based on likelihood ratio criteria. , 1971 .

[35]  L. Mcquitty.  Similarity Analysis by Reciprocal Pairs for Discrete and Continuous Data , 1966 .

[36]  L. Hubert,et al.  A general statistical framework for assessing categorical clustering in free recall. , 1976 .

[37]  Tien Ba Dinh,et al.  An Approximation Approach for a Real-World Variant of Vehicle Routing Problem , 2011, ACIIDS Posters.

[38]  P. Rousseeuw.  Silhouettes: a graphical aid to the interpretation and validation of cluster analysis , 1987 .

[39]  Peter E. Hart,et al.  Nearest neighbor pattern classification , 1967, IEEE Trans. Inf. Theory.

[40]  Harry W. Clifford,et al.  Comparison of Clustering Methods for Investigation of Genome-Wide Methylation Array Data , 2011, Front. Gene..

[41]  Delbert Dueck,et al.  Clustering by Passing Messages Between Data Points , 2007, Science.

[42]  Gilbert Laporte,et al.  Recent Models and Algorithms for One-to-One Pickup and Delivery Problems , 2008 .

[43]  Giselher Pankratz,et al.  A Grouping Genetic Algorithm for the Pickup and Delivery Problem with Time Windows , 2005, OR Spectr..

[44]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .