Download DAFTAR PUSTAKA

DAFTAR PUSTAKA
Balinski, M.L. dan Quandt, R.E. (1964), On an Integer Program for a Delivery
Problem, Operation Research, 12, hal.300-304.
Campbell, A.M. dan Savelsbergh M. (2002), Efficient Insertion Heuristics for
Vehicle Routing Problem and Scheduling Problem, Georgia Institute of
Technology.
Clarke, G. dan Wright, J.W. (1964), Scheduling of Vehicles from a Central Depot
to a Number of Delivery Points, Operation Research, 12, hal. 568-581.
Comtois, C., Slack, B., dan Rodrigue, J.P. (2013). The Geography of Transport
Systems (Third edition, ed.). London; Routledge, Taylor & Francis Group.
Daellenbach, H.G. dan McNickle, D.C. (2005). Decision Making Through Systems
Thinking (First edition, ed.). London; The Palgrave Macmillan.
Dantzig, G.B. dan Ramser, J.H. (1959), The Truck Dispatching Problem,
Management Science, 6, hal. 80-91.
Eglese, R. W. (1990), Simulated Annealing: A Tool of Operational Research,
European Journal of Operational Research, 46, hal. 271-281.
Fisher, M. L. dan Jaikumar R. (1981), A Generalized Assignment Heuristic for
Vehicle Routing, Networks, 11, hal. 109-124.
Ghiani, G., Laporte, G., dan Musmanno, R. (2003), Introduction to Logistic
Systems Planning and Control, Planning and Managing Short-Haul Freight
Transportation, John Wiley & Sons Ltd, England.
xxi
Gillet, B. dan Miller, L. (1974), A Heuristic Algortihm for The Vehicle-dispatch
Problem, Operation Research, 22, hal. 340-349.
Imawati, D. (2004), Pemecahan Vehicle Routing Problem with Multiple Trips and
Time Window dengan Menggunakan Pendekatan Local Search dan
Simulated Annealing, Institut Teknologi Bandung.
Jihadi, M. (2012), Uji Normalitas Data dengan SPSS, Universitas Muhammadiyah
Malang.
Kallehauge, B., Larsen, J., dan Marsen, O.B.G. (2001), Lagrangean Duality
Applied on Vehicle Routing with Time Windows, Technical Report, IMM,
Technical University of Denmark.
Kirkpatrick, S., Gellat, Jr., C.D., dan Vecchi, M.P. (1983), Optimization by
Simulated Annealing, Science 220, hal. 671-680.
Laporte, G., Gendreau, M., Potvin J.Y., dan Semet, F. (2000), Classical and Modern
Heuristic for The Vehicle Routing Problem, International Transactions in
Operational Research, 7, hal. 285-300.
Larsen, J. (1999), Vehicle Routing with Time Windows – Finding Optimal Solution
Efficiently, DORSynt, Dans Selskab for Operations Analysis.
Lin, S. (1965), Computer Solutions of Travelling Salesman Problem, Bell Systems
Technical Journal, 44, hal. 2245-2269.
Liputra, D.T. (2013), Algoritma Simulated Annealing Untuk Pemecahan Masalah
Penentuan Rute dan Penugasan Kapal, Institut Teknologi Bandung.
xxii
Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., dan Teller, E. (1953),
Equaration of State Calculations by Fast Computing Machines, The Journal
of Chemical Physics, 21, hal. 1087-1092.
Osman, I.H. (1993), Metastrategy Simulated Annealing and Tabu Search
Algorithms for The Vehicle Routing Problem, Annals of Operations
Research, 41, hal. 421-451.
Pattawala, A.A. (2013), Analisis dan Usulan Rute Optimum dengan Menggunakan
Algoritma Generate and Test di Pt Agronesia Divisi AMDK (Agroplas),
Universitas Kristen Maranatha
Potvin, J.Y. dan Rousseau, J.M. (1993), A Parallel Route Building Algorithm for
The Vehicle Routing and Scheduling Problem with Time Windows,
European Journal of Operation Research, 66, hal. 331-340.
Siahaan, R. (2014), Pembangunan Aplikasi Informasi Gempa Bumi Untuk
Mengetahui Jarak Pusat Gempa Dengan Pengguna Berbasis Android,
Universitas Komputer Indonesia.
Solomon, M.M. (1987), Algorithms for The Vehicle Routing and Scheduling
Problems with Time Windows Constraint, Operation Research, 35, hal.
254-265.
Tan, K.C., Lee, L.H., Zhu, Q.L., dan Ou, K. (2001), Heuristic Methods for Vehicle
Routing Problem with Time Windows, Artificial Intelligence in
Engineering, 15, hal. 281-295.
Toth, P. dan Vigo, D. (2002). Vehicle Routing Problem (First edition, ed.).
Philadelphia; SIAM.
xxiii
Toth, P. dan Vigo, D. (2014). Vehicle Routing Problem, Methods, and Applications
(Second edition, ed.). Philadelphia; SIAM.
Van Breedam, A. (1995), Improvement Heuristics for the Vehicle Routing Problem
Based on Simulated Annealing, European Journal of Operational
Research, 86, hal. 480-490.
Vigo, D. (1996), A Heuristic Algorithm for The Asymmetric Capacitated Vehicle
Routing Problem, European Journal of Operational Research, 89, hal. 108126.
Viktaria, A. (2015), Efektivitas Algoritma Simulated Annealing dan Large
Neighborhood Search Dalam Penyelesaian Pickup and Delivery Vehicle
Routing Problem with Time Windows, Universitas Negeri Yogyakarta.
Wren, A. dan Holliday, A. (1972), Computer Scheduling of Vehicles from One or
More Depots to a Number of Delivery Points, Operation Research
Quarterly, 23, hal. 333-344.
xxiv