Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(routing with time windows). Showing records 1 – 30 of 43762 total matches.

[1] [2] [3] [4] [5] … [1459]

Search Limiters

Last 2 Years | English Only

Degrees

Languages

Country

▼ Search Limiters


Arizona State University

1. Li, Xiaoyan. Capacitated Vehicle Routing Problem with Time Windows: A Case Study on Pickup of Dietary Products in Nonprofit Organization.

Degree: Industrial Engineering, 2015, Arizona State University

 This thesis presents a successful application of operations research techniques in nonprofit distribution system to improve the distribution efficiency and increase customer service quality. It… (more)

Subjects/Keywords: Industrial engineering; Operations research; Ant Colony Algorithm; Capacitated Vehicle Routing Problem with Time Windows; Local Search; Vehicle Routing Problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Li, X. (2015). Capacitated Vehicle Routing Problem with Time Windows: A Case Study on Pickup of Dietary Products in Nonprofit Organization. (Masters Thesis). Arizona State University. Retrieved from http://repository.asu.edu/items/35422

Chicago Manual of Style (16th Edition):

Li, Xiaoyan. “Capacitated Vehicle Routing Problem with Time Windows: A Case Study on Pickup of Dietary Products in Nonprofit Organization.” 2015. Masters Thesis, Arizona State University. Accessed March 08, 2021. http://repository.asu.edu/items/35422.

MLA Handbook (7th Edition):

Li, Xiaoyan. “Capacitated Vehicle Routing Problem with Time Windows: A Case Study on Pickup of Dietary Products in Nonprofit Organization.” 2015. Web. 08 Mar 2021.

Vancouver:

Li X. Capacitated Vehicle Routing Problem with Time Windows: A Case Study on Pickup of Dietary Products in Nonprofit Organization. [Internet] [Masters thesis]. Arizona State University; 2015. [cited 2021 Mar 08]. Available from: http://repository.asu.edu/items/35422.

Council of Science Editors:

Li X. Capacitated Vehicle Routing Problem with Time Windows: A Case Study on Pickup of Dietary Products in Nonprofit Organization. [Masters Thesis]. Arizona State University; 2015. Available from: http://repository.asu.edu/items/35422


Loughborough University

2. Ji, Chenlu. Service scheduling and vehicle routing problem to minimise the risk of missing appointments.

Degree: PhD, 2019, Loughborough University

 This research studies a workforce scheduling and vehicle routing problem where technicians drive a vehicle to customer locations to perform service tasks. The service times… (more)

Subjects/Keywords: 658; Business and Management not elsewhere classified; Scheduling; Vehicle Routing with Time Windows; Stochastic Service and Travel Time; Risk Minimisation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ji, C. (2019). Service scheduling and vehicle routing problem to minimise the risk of missing appointments. (Doctoral Dissertation). Loughborough University. Retrieved from https://doi.org/10.26174/thesis.lboro.8319731.v1 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.785257

Chicago Manual of Style (16th Edition):

Ji, Chenlu. “Service scheduling and vehicle routing problem to minimise the risk of missing appointments.” 2019. Doctoral Dissertation, Loughborough University. Accessed March 08, 2021. https://doi.org/10.26174/thesis.lboro.8319731.v1 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.785257.

MLA Handbook (7th Edition):

Ji, Chenlu. “Service scheduling and vehicle routing problem to minimise the risk of missing appointments.” 2019. Web. 08 Mar 2021.

Vancouver:

Ji C. Service scheduling and vehicle routing problem to minimise the risk of missing appointments. [Internet] [Doctoral dissertation]. Loughborough University; 2019. [cited 2021 Mar 08]. Available from: https://doi.org/10.26174/thesis.lboro.8319731.v1 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.785257.

Council of Science Editors:

Ji C. Service scheduling and vehicle routing problem to minimise the risk of missing appointments. [Doctoral Dissertation]. Loughborough University; 2019. Available from: https://doi.org/10.26174/thesis.lboro.8319731.v1 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.785257


University of California – Irvine

3. Raj, Ranga. Efficient Mechanisms for Network State Management And Data Capture in MultiNetworks.

Degree: Information and Computer Science, 2015, University of California – Irvine

 Multinetwork INformation Architecture(MINA) is a reflective (self-observing and adapting) middleware approach to manage such dynamic and heterogeneous multi-networks in pervasive environments. MINA depends upon a… (more)

Subjects/Keywords: Computer science; Dynamic Vehicle Routing Problem with Time Windows; mobile data collector; multi-networks; node mobility

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Raj, R. (2015). Efficient Mechanisms for Network State Management And Data Capture in MultiNetworks. (Thesis). University of California – Irvine. Retrieved from http://www.escholarship.org/uc/item/9rk7994k

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Raj, Ranga. “Efficient Mechanisms for Network State Management And Data Capture in MultiNetworks.” 2015. Thesis, University of California – Irvine. Accessed March 08, 2021. http://www.escholarship.org/uc/item/9rk7994k.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Raj, Ranga. “Efficient Mechanisms for Network State Management And Data Capture in MultiNetworks.” 2015. Web. 08 Mar 2021.

Vancouver:

Raj R. Efficient Mechanisms for Network State Management And Data Capture in MultiNetworks. [Internet] [Thesis]. University of California – Irvine; 2015. [cited 2021 Mar 08]. Available from: http://www.escholarship.org/uc/item/9rk7994k.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Raj R. Efficient Mechanisms for Network State Management And Data Capture in MultiNetworks. [Thesis]. University of California – Irvine; 2015. Available from: http://www.escholarship.org/uc/item/9rk7994k

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

4. Lin, Bo. Optimizing EV Routing and Charging/Discharging under Time-Variant Electricity Prices.

Degree: 2020, University of Waterloo

 The integration of electric vehicles (EVs) and the power system has been becoming an increasingly important field of research, due to the rapid EV penetration… (more)

Subjects/Keywords: electric vehicle routing problem with time windows; vehicle-to-grid; Lagrangian relaxation; meta-heuristic; reinforcement learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lin, B. (2020). Optimizing EV Routing and Charging/Discharging under Time-Variant Electricity Prices. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/16136

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lin, Bo. “Optimizing EV Routing and Charging/Discharging under Time-Variant Electricity Prices.” 2020. Thesis, University of Waterloo. Accessed March 08, 2021. http://hdl.handle.net/10012/16136.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lin, Bo. “Optimizing EV Routing and Charging/Discharging under Time-Variant Electricity Prices.” 2020. Web. 08 Mar 2021.

Vancouver:

Lin B. Optimizing EV Routing and Charging/Discharging under Time-Variant Electricity Prices. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/10012/16136.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lin B. Optimizing EV Routing and Charging/Discharging under Time-Variant Electricity Prices. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/16136

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Technical University of Lisbon

5. Pereira, Diogo Rafael Parreiras. Criação de rotas de entrega de produtos e recolha de paletes : aplicação à A Padaria Portuguesa.

Degree: 2016, Technical University of Lisbon

Mestrado em Decisão Económica e Empresarial

Este estudo foi feito juntamente com um estágio na organização "A Padaria Portuguesa" e tem como principal objetivo a… (more)

Subjects/Keywords: Problemas de roteamento de veículos com entregas e recolhas com janelas temporais; heurísticas; VBA; Vehicle routing problems; including both distribution and collection; with time windows; heuristic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Pereira, D. R. P. (2016). Criação de rotas de entrega de produtos e recolha de paletes : aplicação à A Padaria Portuguesa. (Thesis). Technical University of Lisbon. Retrieved from https://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/13462

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Pereira, Diogo Rafael Parreiras. “Criação de rotas de entrega de produtos e recolha de paletes : aplicação à A Padaria Portuguesa.” 2016. Thesis, Technical University of Lisbon. Accessed March 08, 2021. https://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/13462.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Pereira, Diogo Rafael Parreiras. “Criação de rotas de entrega de produtos e recolha de paletes : aplicação à A Padaria Portuguesa.” 2016. Web. 08 Mar 2021.

Vancouver:

Pereira DRP. Criação de rotas de entrega de produtos e recolha de paletes : aplicação à A Padaria Portuguesa. [Internet] [Thesis]. Technical University of Lisbon; 2016. [cited 2021 Mar 08]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/13462.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pereira DRP. Criação de rotas de entrega de produtos e recolha de paletes : aplicação à A Padaria Portuguesa. [Thesis]. Technical University of Lisbon; 2016. Available from: https://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/13462

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

6. Lappas, Pantelis. Models and solution algorithms for inventory routing problems.

Degree: 2017, Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών

The main objective of this thesis is to propose a hybrid evolutionary optimization algorithm for solving the Inventory Routing Problem (IRP). The IRP arises from… (more)

Subjects/Keywords: Δρομολόγηση; Πρόβλημα Δρομολόγησης Αποθεμάτων; Πρόβλημα Δρομολόγησης Αποθεμάτων με Χρονικά Παράθυρα; Γενετικός αλγόριθμος; Αλγόριθμος προσομοιωμένης ανόπτησης; Εξελικτική Βελτιστοποίηση; Προσομοίωση; Αλγόριθμος Μεταβλητής Γειτονιάς Αναζήτησης; Routing; Inventory Routing Problem; Inventory Routing Problem with Time Windows; Genetic algorithm; Simulated annealing algorithm; Evolutionary Optimization; Simulation; Variable Neighborhood Search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lappas, P. (2017). Models and solution algorithms for inventory routing problems. (Thesis). Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών. Retrieved from http://hdl.handle.net/10442/hedi/40978

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lappas, Pantelis. “Models and solution algorithms for inventory routing problems.” 2017. Thesis, Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών. Accessed March 08, 2021. http://hdl.handle.net/10442/hedi/40978.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lappas, Pantelis. “Models and solution algorithms for inventory routing problems.” 2017. Web. 08 Mar 2021.

Vancouver:

Lappas P. Models and solution algorithms for inventory routing problems. [Internet] [Thesis]. Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών; 2017. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/10442/hedi/40978.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lappas P. Models and solution algorithms for inventory routing problems. [Thesis]. Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών; 2017. Available from: http://hdl.handle.net/10442/hedi/40978

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Arizona State University

7. Mahmoudi, Monirehalsadat. Shared Mobility Optimization in Large Scale Transportation Networks: Methodology and Applications.

Degree: Civil, Environmental and Sustainable Engineering, 2018, Arizona State University

 Optimization of on-demand transportation systems and ride-sharing services involves solving a class of complex vehicle routing problems with pickup and delivery with time windows (VRPPDTW).… (more)

Subjects/Keywords: Civil engineering; Industrial engineering; Operations research; Dynamic programming; Pickup and delivery with synchronized transfers; Resource hyperprisms; Ride-sharing service optimization; Time-dependent shortest path problem; Vehicle routing problem with pickup and delivery with time windows

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mahmoudi, M. (2018). Shared Mobility Optimization in Large Scale Transportation Networks: Methodology and Applications. (Doctoral Dissertation). Arizona State University. Retrieved from http://repository.asu.edu/items/49355

Chicago Manual of Style (16th Edition):

Mahmoudi, Monirehalsadat. “Shared Mobility Optimization in Large Scale Transportation Networks: Methodology and Applications.” 2018. Doctoral Dissertation, Arizona State University. Accessed March 08, 2021. http://repository.asu.edu/items/49355.

MLA Handbook (7th Edition):

Mahmoudi, Monirehalsadat. “Shared Mobility Optimization in Large Scale Transportation Networks: Methodology and Applications.” 2018. Web. 08 Mar 2021.

Vancouver:

Mahmoudi M. Shared Mobility Optimization in Large Scale Transportation Networks: Methodology and Applications. [Internet] [Doctoral dissertation]. Arizona State University; 2018. [cited 2021 Mar 08]. Available from: http://repository.asu.edu/items/49355.

Council of Science Editors:

Mahmoudi M. Shared Mobility Optimization in Large Scale Transportation Networks: Methodology and Applications. [Doctoral Dissertation]. Arizona State University; 2018. Available from: http://repository.asu.edu/items/49355

8. Duque Villarreal , Daniel. Solving the Orienteering Problem with Time Windows Via the Pulse .

Degree: 2016, Universidad de los Andes

 El Problema de Orientación con Ventanas de Tiempo (OPTW por sus siglas en ingles) consiste en encontrar un camino que maximice el beneficio disponible en… (more)

Subjects/Keywords: Routing; Trip design; Traveling salesman problem with profits; Vehicle Routing Problem with Time Windows

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Duque Villarreal , D. (2016). Solving the Orienteering Problem with Time Windows Via the Pulse . (Thesis). Universidad de los Andes. Retrieved from http://documentodegrado.uniandes.edu.co/documentos/Duque_OPTW_05302013.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Duque Villarreal , Daniel. “Solving the Orienteering Problem with Time Windows Via the Pulse .” 2016. Thesis, Universidad de los Andes. Accessed March 08, 2021. http://documentodegrado.uniandes.edu.co/documentos/Duque_OPTW_05302013.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Duque Villarreal , Daniel. “Solving the Orienteering Problem with Time Windows Via the Pulse .” 2016. Web. 08 Mar 2021.

Vancouver:

Duque Villarreal D. Solving the Orienteering Problem with Time Windows Via the Pulse . [Internet] [Thesis]. Universidad de los Andes; 2016. [cited 2021 Mar 08]. Available from: http://documentodegrado.uniandes.edu.co/documentos/Duque_OPTW_05302013.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Duque Villarreal D. Solving the Orienteering Problem with Time Windows Via the Pulse . [Thesis]. Universidad de los Andes; 2016. Available from: http://documentodegrado.uniandes.edu.co/documentos/Duque_OPTW_05302013.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


KTH

9. Lundkvist, Henrik. Robust Vehicle Routing in an Urban Setting.

Degree: Optimization and Systems Theory, 2016, KTH

In this thesis, the vehicle routing problem with stochastic, and time dependent, travel times is studied. The stochastic travel times are estimated from historical… (more)

Subjects/Keywords: Vehicle routing problem; Stochastic travel times; Time dependent rive times; Time Windows.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lundkvist, H. (2016). Robust Vehicle Routing in an Urban Setting. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-186248

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lundkvist, Henrik. “Robust Vehicle Routing in an Urban Setting.” 2016. Thesis, KTH. Accessed March 08, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-186248.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lundkvist, Henrik. “Robust Vehicle Routing in an Urban Setting.” 2016. Web. 08 Mar 2021.

Vancouver:

Lundkvist H. Robust Vehicle Routing in an Urban Setting. [Internet] [Thesis]. KTH; 2016. [cited 2021 Mar 08]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-186248.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lundkvist H. Robust Vehicle Routing in an Urban Setting. [Thesis]. KTH; 2016. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-186248

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Vienna

10. Titova, Kseniya. A penalty-based edge-assembly memetic algorithm for the vehicle routing problem with synchronization constraints in city logistics.

Degree: 2018, University of Vienna

In dieser Arbeit wird ein metaheuristischer Ansatz zur Lösung eines Vehicle Routing Prob-lems (VRP) mit Synchronisationsbeschränkungen in der Citylogistik vorgestellt. Der Algo-rithmus generiert Lösungen, die… (more)

Subjects/Keywords: 54.59 Programmierung: Sonstiges; 85.15 Forschung und Entwicklung; 85.99 Betriebswirtschaft: Sonstiges; Vehicle Routing Problem mit Synchronisationsbeschränkungen / Stadtlogistik / metaheuristischer Ansatz / memetischer Algorithmus / selbst auferlegten Zeitfenstern / GRASP; vehicle routing problem with synchronization constraints / city logistics / metaheuristic approach / memetic algorithm / self-imposed time windows / GRASP

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Titova, K. (2018). A penalty-based edge-assembly memetic algorithm for the vehicle routing problem with synchronization constraints in city logistics. (Thesis). University of Vienna. Retrieved from http://othes.univie.ac.at/55323/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Titova, Kseniya. “A penalty-based edge-assembly memetic algorithm for the vehicle routing problem with synchronization constraints in city logistics.” 2018. Thesis, University of Vienna. Accessed March 08, 2021. http://othes.univie.ac.at/55323/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Titova, Kseniya. “A penalty-based edge-assembly memetic algorithm for the vehicle routing problem with synchronization constraints in city logistics.” 2018. Web. 08 Mar 2021.

Vancouver:

Titova K. A penalty-based edge-assembly memetic algorithm for the vehicle routing problem with synchronization constraints in city logistics. [Internet] [Thesis]. University of Vienna; 2018. [cited 2021 Mar 08]. Available from: http://othes.univie.ac.at/55323/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Titova K. A penalty-based edge-assembly memetic algorithm for the vehicle routing problem with synchronization constraints in city logistics. [Thesis]. University of Vienna; 2018. Available from: http://othes.univie.ac.at/55323/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Delft University of Technology

11. Brandt, Jelmer (author). Order pairing strategies for the Petrol Station Replenishment Problem: A model to find new approaches for pairing orders in a multi–period vehicle routing problem with time windows.

Degree: 2017, Delft University of Technology

This thesis explores the possibilities to improve order allocation for petrol delivery with the aim to lower the travel distances. In this research a simulation… (more)

Subjects/Keywords: Petrol station replenishment; time windows; Fuel delivery; Vehicle routing and scheduling; Vehicle restrictions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Brandt, J. (. (2017). Order pairing strategies for the Petrol Station Replenishment Problem: A model to find new approaches for pairing orders in a multi–period vehicle routing problem with time windows. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:d77656e3-e451-4a11-84ce-9740be96759d

Chicago Manual of Style (16th Edition):

Brandt, Jelmer (author). “Order pairing strategies for the Petrol Station Replenishment Problem: A model to find new approaches for pairing orders in a multi–period vehicle routing problem with time windows.” 2017. Masters Thesis, Delft University of Technology. Accessed March 08, 2021. http://resolver.tudelft.nl/uuid:d77656e3-e451-4a11-84ce-9740be96759d.

MLA Handbook (7th Edition):

Brandt, Jelmer (author). “Order pairing strategies for the Petrol Station Replenishment Problem: A model to find new approaches for pairing orders in a multi–period vehicle routing problem with time windows.” 2017. Web. 08 Mar 2021.

Vancouver:

Brandt J(. Order pairing strategies for the Petrol Station Replenishment Problem: A model to find new approaches for pairing orders in a multi–period vehicle routing problem with time windows. [Internet] [Masters thesis]. Delft University of Technology; 2017. [cited 2021 Mar 08]. Available from: http://resolver.tudelft.nl/uuid:d77656e3-e451-4a11-84ce-9740be96759d.

Council of Science Editors:

Brandt J(. Order pairing strategies for the Petrol Station Replenishment Problem: A model to find new approaches for pairing orders in a multi–period vehicle routing problem with time windows. [Masters Thesis]. Delft University of Technology; 2017. Available from: http://resolver.tudelft.nl/uuid:d77656e3-e451-4a11-84ce-9740be96759d


Georgia Tech

12. Daniel, Aang. Routing and Scheduling with Time Windows: Models and Algorithms for Tramp Sea Cargos and Rail Car-Blocks.

Degree: PhD, Industrial and Systems Engineering, 2006, Georgia Tech

 This thesis introduces a new model formulation to solve routing and scheduling problems, with the main applications in answering routing and scheduling problems faced by… (more)

Subjects/Keywords: Scheduling; Optimal schedule; Cargo transfer model; Routing and scheduling with time windows; Bilinear constraints; Vehicle routing; Pickup and delivery problem; Train routing and scheduling; Sea cargo routing and scheduling; Sea cargo routing; VRP; Train scheduling; Soft time windows; Set packing; Optimal train schedule; Cargo ships; Optimum ship routing; Scheduling; Mathematical models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Daniel, A. (2006). Routing and Scheduling with Time Windows: Models and Algorithms for Tramp Sea Cargos and Rail Car-Blocks. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/19698

Chicago Manual of Style (16th Edition):

Daniel, Aang. “Routing and Scheduling with Time Windows: Models and Algorithms for Tramp Sea Cargos and Rail Car-Blocks.” 2006. Doctoral Dissertation, Georgia Tech. Accessed March 08, 2021. http://hdl.handle.net/1853/19698.

MLA Handbook (7th Edition):

Daniel, Aang. “Routing and Scheduling with Time Windows: Models and Algorithms for Tramp Sea Cargos and Rail Car-Blocks.” 2006. Web. 08 Mar 2021.

Vancouver:

Daniel A. Routing and Scheduling with Time Windows: Models and Algorithms for Tramp Sea Cargos and Rail Car-Blocks. [Internet] [Doctoral dissertation]. Georgia Tech; 2006. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/1853/19698.

Council of Science Editors:

Daniel A. Routing and Scheduling with Time Windows: Models and Algorithms for Tramp Sea Cargos and Rail Car-Blocks. [Doctoral Dissertation]. Georgia Tech; 2006. Available from: http://hdl.handle.net/1853/19698


University of Melbourne

13. Duane, Emily Jane Eleftheria. New data generation and solution techniques for the Sequential Ordering Problem with Time Windows.

Degree: 2014, University of Melbourne

 The motivation for this thesis resulted from a study of semi-automated rail mounted gantry cranes at an Australian seaport container terminal. The Sequential Ordering Problem… (more)

Subjects/Keywords: Sequential Ordering Problem with Time Windows; SOP-TW; Asymmetric Travelling Salesman Problem with Time Windows and additional Precedence Constraints; ATSP-TW-PC; crane scheduling; machine scheduling; heuristics; branch-and-bound

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Duane, E. J. E. (2014). New data generation and solution techniques for the Sequential Ordering Problem with Time Windows. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/54610

Chicago Manual of Style (16th Edition):

Duane, Emily Jane Eleftheria. “New data generation and solution techniques for the Sequential Ordering Problem with Time Windows.” 2014. Doctoral Dissertation, University of Melbourne. Accessed March 08, 2021. http://hdl.handle.net/11343/54610.

MLA Handbook (7th Edition):

Duane, Emily Jane Eleftheria. “New data generation and solution techniques for the Sequential Ordering Problem with Time Windows.” 2014. Web. 08 Mar 2021.

Vancouver:

Duane EJE. New data generation and solution techniques for the Sequential Ordering Problem with Time Windows. [Internet] [Doctoral dissertation]. University of Melbourne; 2014. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/11343/54610.

Council of Science Editors:

Duane EJE. New data generation and solution techniques for the Sequential Ordering Problem with Time Windows. [Doctoral Dissertation]. University of Melbourne; 2014. Available from: http://hdl.handle.net/11343/54610


Universidade de Lisboa

14. Silva, João Carlos Lopes da. Planeamento de rotas de distribuição.

Degree: 2016, Universidade de Lisboa

Tese de mestrado, Estatística e Investigação Operacional, Universidade de Lisboa, Faculdade de Ciências, 2016

Considerando um conjunto de clientes que necessitam de ser visitados num… (more)

Subjects/Keywords: Algoritmos exactos; Traveling Salesman Problem; Vehicle Routing Problem; Time Windows; Teses de mestrado - 2016; Departamento de Estatística e Investigação Operacional

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Silva, J. C. L. d. (2016). Planeamento de rotas de distribuição. (Thesis). Universidade de Lisboa. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:repositorio.ul.pt:10451/24881

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Silva, João Carlos Lopes da. “Planeamento de rotas de distribuição.” 2016. Thesis, Universidade de Lisboa. Accessed March 08, 2021. http://www.rcaap.pt/detail.jsp?id=oai:repositorio.ul.pt:10451/24881.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Silva, João Carlos Lopes da. “Planeamento de rotas de distribuição.” 2016. Web. 08 Mar 2021.

Vancouver:

Silva JCLd. Planeamento de rotas de distribuição. [Internet] [Thesis]. Universidade de Lisboa; 2016. [cited 2021 Mar 08]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:repositorio.ul.pt:10451/24881.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Silva JCLd. Planeamento de rotas de distribuição. [Thesis]. Universidade de Lisboa; 2016. Available from: http://www.rcaap.pt/detail.jsp?id=oai:repositorio.ul.pt:10451/24881

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

15. Γκορτσίλας, Δημήτριος. Νέες ευρετικές προσεγγίσεις για δρομολόγηση στόλου οχημάτων.

Degree: 2014, University of Patras

Στην παρούσα μεταπτυχιακή διπλωματική εργασία μελετήθηκε το πρόβλημα Δρομολόγησης Στόλου Οχημάτων με Παράθυρα Χρόνου (VRPTW) κάτω από ένα φιλικό προς το περιβάλλον πρίσμα που απαιτεί… (more)

Subjects/Keywords: Δρομολόγηση στόλου οχημάτων; Ευρετικό; Παράθυρα χρόνου; Δυναμικά σενάρια; 006.3; Vehicle routing problem; Heuristic; Time windows; Dynamic scenarios

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Γκορτσίλας, . (2014). Νέες ευρετικές προσεγγίσεις για δρομολόγηση στόλου οχημάτων. (Masters Thesis). University of Patras. Retrieved from http://hdl.handle.net/10889/8327

Chicago Manual of Style (16th Edition):

Γκορτσίλας, Δημήτριος. “Νέες ευρετικές προσεγγίσεις για δρομολόγηση στόλου οχημάτων.” 2014. Masters Thesis, University of Patras. Accessed March 08, 2021. http://hdl.handle.net/10889/8327.

MLA Handbook (7th Edition):

Γκορτσίλας, Δημήτριος. “Νέες ευρετικές προσεγγίσεις για δρομολόγηση στόλου οχημάτων.” 2014. Web. 08 Mar 2021.

Vancouver:

Γκορτσίλας . Νέες ευρετικές προσεγγίσεις για δρομολόγηση στόλου οχημάτων. [Internet] [Masters thesis]. University of Patras; 2014. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/10889/8327.

Council of Science Editors:

Γκορτσίλας . Νέες ευρετικές προσεγγίσεις για δρομολόγηση στόλου οχημάτων. [Masters Thesis]. University of Patras; 2014. Available from: http://hdl.handle.net/10889/8327


University of Iowa

16. Voccia, Stacy Ann. Stochastic last-mile delivery problems with time constraints.

Degree: PhD, Business Administration, 2015, University of Iowa

  When a package is shipped, the customer often requires the delivery to be made within a particular time window or by a deadline. However,… (more)

Subjects/Keywords: publicabstract; Deadlines; Dynamic Programming; Last-Mile Delivery; Stochastic; Time Windows; Vehicle Routing; Business Administration, Management, and Operations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Voccia, S. A. (2015). Stochastic last-mile delivery problems with time constraints. (Doctoral Dissertation). University of Iowa. Retrieved from https://ir.uiowa.edu/etd/1924

Chicago Manual of Style (16th Edition):

Voccia, Stacy Ann. “Stochastic last-mile delivery problems with time constraints.” 2015. Doctoral Dissertation, University of Iowa. Accessed March 08, 2021. https://ir.uiowa.edu/etd/1924.

MLA Handbook (7th Edition):

Voccia, Stacy Ann. “Stochastic last-mile delivery problems with time constraints.” 2015. Web. 08 Mar 2021.

Vancouver:

Voccia SA. Stochastic last-mile delivery problems with time constraints. [Internet] [Doctoral dissertation]. University of Iowa; 2015. [cited 2021 Mar 08]. Available from: https://ir.uiowa.edu/etd/1924.

Council of Science Editors:

Voccia SA. Stochastic last-mile delivery problems with time constraints. [Doctoral Dissertation]. University of Iowa; 2015. Available from: https://ir.uiowa.edu/etd/1924

17. Chang, Chia-Sheng. A period vehicle routing problem with time windows and backhauls.

Degree: PhD, Operations Research, 1993, Case Western Reserve University School of Graduate Studies

 This dissertation develops solution procedures for the Period Vehicle Routing Problem with Time-windows and Backhauls (PVRPTWB). The problem includes many real-world considerations, such as time-window… (more)

Subjects/Keywords: period vehicle; routing problem; time windows; backhauls

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chang, C. (1993). A period vehicle routing problem with time windows and backhauls. (Doctoral Dissertation). Case Western Reserve University School of Graduate Studies. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=case1057156056

Chicago Manual of Style (16th Edition):

Chang, Chia-Sheng. “A period vehicle routing problem with time windows and backhauls.” 1993. Doctoral Dissertation, Case Western Reserve University School of Graduate Studies. Accessed March 08, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=case1057156056.

MLA Handbook (7th Edition):

Chang, Chia-Sheng. “A period vehicle routing problem with time windows and backhauls.” 1993. Web. 08 Mar 2021.

Vancouver:

Chang C. A period vehicle routing problem with time windows and backhauls. [Internet] [Doctoral dissertation]. Case Western Reserve University School of Graduate Studies; 1993. [cited 2021 Mar 08]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1057156056.

Council of Science Editors:

Chang C. A period vehicle routing problem with time windows and backhauls. [Doctoral Dissertation]. Case Western Reserve University School of Graduate Studies; 1993. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1057156056


Brno University of Technology

18. Ružička, Vladimír. Aplikace problému Obchodního cestujícího v reálném prostředí distribuční společnosti: Travelling Salesman Problem Application in Particular Logistics Enterprise.

Degree: 2019, Brno University of Technology

 This paper deals with optimal distribution issues. One may find listed problems of real life linked to distribution. Moreover, there are explained travelling salesman problem,… (more)

Subjects/Keywords: Problém plánování tras; VRP; Problém obchodního cestujícího; POC; časové okna; optimální distribuce; heuristika; meta-heuristika; dynamický VRP; DVRP; stochastický VRP; SVRP; mnoho instancí VRP; MIVRP; průběžné nakládání; VRPCL.; Vehicle routing problem; VRP; travelling salesman problem; TSP; time windows; optimal distribution; heuristics; meta-heuristics; dynamic VRP; DVRP; stochastic VRP; SVRP; multiple instances of VRP; MIVRP; VRP with continuous loading; VRPCL.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ružička, V. (2019). Aplikace problému Obchodního cestujícího v reálném prostředí distribuční společnosti: Travelling Salesman Problem Application in Particular Logistics Enterprise. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53721

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ružička, Vladimír. “Aplikace problému Obchodního cestujícího v reálném prostředí distribuční společnosti: Travelling Salesman Problem Application in Particular Logistics Enterprise.” 2019. Thesis, Brno University of Technology. Accessed March 08, 2021. http://hdl.handle.net/11012/53721.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ružička, Vladimír. “Aplikace problému Obchodního cestujícího v reálném prostředí distribuční společnosti: Travelling Salesman Problem Application in Particular Logistics Enterprise.” 2019. Web. 08 Mar 2021.

Vancouver:

Ružička V. Aplikace problému Obchodního cestujícího v reálném prostředí distribuční společnosti: Travelling Salesman Problem Application in Particular Logistics Enterprise. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/11012/53721.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ružička V. Aplikace problému Obchodního cestujícího v reálném prostředí distribuční společnosti: Travelling Salesman Problem Application in Particular Logistics Enterprise. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/53721

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

19. Nilsson, Mikael. Parameter Tuning Experiments of Population-based Algorithms.

Degree: Information Technology and Media, 2011, Mid Sweden University

  In this study, three different algorithms are implemented to solve thecapacitated vehicle routing problem with and without time windows:ant colony optimization, a genetic algorithm… (more)

Subjects/Keywords: Artificial Intelligence; Ant Colony Optimization; Genetic Algorithm; Self-Organizing Map; Capacitated Vehicle Routing Problem; Capacitated Vehicle Routing Problem with Time Windows; SPOT; ParamILS.; Computer Engineering; Datorteknik

…nearest integer. 1.1.2 Capacitated Vehicle Routing Problem with Time Windows The CVRPTW is an… …on the Capacitated Vehicle Routing Problem with and without time windows and which one is… …Routing Problem with and without Time Windows.  Tune and test these algorithms on many… …It can be used as a standalone algorithm to solve CVRP and CVRP with soft time windows. The… …with soft time windows no penalty is given for late deliveries. The reason for this is that… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Nilsson, M. (2011). Parameter Tuning Experiments of Population-based Algorithms. (Thesis). Mid Sweden University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-13836

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Nilsson, Mikael. “Parameter Tuning Experiments of Population-based Algorithms.” 2011. Thesis, Mid Sweden University. Accessed March 08, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-13836.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Nilsson, Mikael. “Parameter Tuning Experiments of Population-based Algorithms.” 2011. Web. 08 Mar 2021.

Vancouver:

Nilsson M. Parameter Tuning Experiments of Population-based Algorithms. [Internet] [Thesis]. Mid Sweden University; 2011. [cited 2021 Mar 08]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-13836.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Nilsson M. Parameter Tuning Experiments of Population-based Algorithms. [Thesis]. Mid Sweden University; 2011. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-13836

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Pretoria

20. [No author]. Design of a selective parallel heuristic algorithm for the vehicle routing problem on an adaptive object model .

Degree: 2010, University of Pretoria

 The Vehicle Routing Problem has been around for more than 50 years and has been of major interest to the operations research community. The VRP… (more)

Subjects/Keywords: Multiple time windows; Multiple constraints; Tabu search; Ant system; Memetic algorithm; Hyper-heuristics; Meta-heuristics; Vehicle routing problem; Supply chain management; Compatibility matrix; Parallel; UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

author], [. (2010). Design of a selective parallel heuristic algorithm for the vehicle routing problem on an adaptive object model . (Doctoral Dissertation). University of Pretoria. Retrieved from http://upetd.up.ac.za/thesis/available/etd-11192010-165951/

Chicago Manual of Style (16th Edition):

author], [No. “Design of a selective parallel heuristic algorithm for the vehicle routing problem on an adaptive object model .” 2010. Doctoral Dissertation, University of Pretoria. Accessed March 08, 2021. http://upetd.up.ac.za/thesis/available/etd-11192010-165951/.

MLA Handbook (7th Edition):

author], [No. “Design of a selective parallel heuristic algorithm for the vehicle routing problem on an adaptive object model .” 2010. Web. 08 Mar 2021.

Vancouver:

author] [. Design of a selective parallel heuristic algorithm for the vehicle routing problem on an adaptive object model . [Internet] [Doctoral dissertation]. University of Pretoria; 2010. [cited 2021 Mar 08]. Available from: http://upetd.up.ac.za/thesis/available/etd-11192010-165951/.

Council of Science Editors:

author] [. Design of a selective parallel heuristic algorithm for the vehicle routing problem on an adaptive object model . [Doctoral Dissertation]. University of Pretoria; 2010. Available from: http://upetd.up.ac.za/thesis/available/etd-11192010-165951/


Kyoto University / 京都大学

21. Sattrawut, Ponboon. EXACT SOLUTIONS FOR LOCATION-ROUTING PROBLEMS WITH TIME WINDOWS USING BRANCH-AND-PRICE METHOD : 分枝価格法を用いたタイムウィンドウ付配置配送計画の厳密解.

Degree: 博士(工学), 2015, Kyoto University / 京都大学

新制・課程博士

甲第19287号

工博第4084号

Subjects/Keywords: Location-Routing Problem; Time Windows; Branch-and-Price; Column Generation; Labeling Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sattrawut, P. (2015). EXACT SOLUTIONS FOR LOCATION-ROUTING PROBLEMS WITH TIME WINDOWS USING BRANCH-AND-PRICE METHOD : 分枝価格法を用いたタイムウィンドウ付配置配送計画の厳密解. (Thesis). Kyoto University / 京都大学. Retrieved from http://hdl.handle.net/2433/202692 ; http://dx.doi.org/10.14989/doctor.k19287

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sattrawut, Ponboon. “EXACT SOLUTIONS FOR LOCATION-ROUTING PROBLEMS WITH TIME WINDOWS USING BRANCH-AND-PRICE METHOD : 分枝価格法を用いたタイムウィンドウ付配置配送計画の厳密解.” 2015. Thesis, Kyoto University / 京都大学. Accessed March 08, 2021. http://hdl.handle.net/2433/202692 ; http://dx.doi.org/10.14989/doctor.k19287.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sattrawut, Ponboon. “EXACT SOLUTIONS FOR LOCATION-ROUTING PROBLEMS WITH TIME WINDOWS USING BRANCH-AND-PRICE METHOD : 分枝価格法を用いたタイムウィンドウ付配置配送計画の厳密解.” 2015. Web. 08 Mar 2021.

Vancouver:

Sattrawut P. EXACT SOLUTIONS FOR LOCATION-ROUTING PROBLEMS WITH TIME WINDOWS USING BRANCH-AND-PRICE METHOD : 分枝価格法を用いたタイムウィンドウ付配置配送計画の厳密解. [Internet] [Thesis]. Kyoto University / 京都大学; 2015. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/2433/202692 ; http://dx.doi.org/10.14989/doctor.k19287.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sattrawut P. EXACT SOLUTIONS FOR LOCATION-ROUTING PROBLEMS WITH TIME WINDOWS USING BRANCH-AND-PRICE METHOD : 分枝価格法を用いたタイムウィンドウ付配置配送計画の厳密解. [Thesis]. Kyoto University / 京都大学; 2015. Available from: http://hdl.handle.net/2433/202692 ; http://dx.doi.org/10.14989/doctor.k19287

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Kyoto University / 京都大学

22. Manasanan, Titapunyapat. A GENETIC APPROACH FOR TWO-ECHELON CAPACITATED VEHICLE ROUTING AND SCHEDULING PROBLEM WITH TIME WINDOWS : タイムウィンドウ付き2段階配車配送計画に関する遺伝的アプローチ.

Degree: 博士(工学), 2015, Kyoto University / 京都大学

新制・課程博士

甲第19290号

工博第4087号

Subjects/Keywords: 2-Echelon Vehicle Routing Problem; Time Windows; Genetic Algorithms; Scheduling Problem; City Logistics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Manasanan, T. (2015). A GENETIC APPROACH FOR TWO-ECHELON CAPACITATED VEHICLE ROUTING AND SCHEDULING PROBLEM WITH TIME WINDOWS : タイムウィンドウ付き2段階配車配送計画に関する遺伝的アプローチ. (Thesis). Kyoto University / 京都大学. Retrieved from http://hdl.handle.net/2433/202695 ; http://dx.doi.org/10.14989/doctor.k19290

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Manasanan, Titapunyapat. “A GENETIC APPROACH FOR TWO-ECHELON CAPACITATED VEHICLE ROUTING AND SCHEDULING PROBLEM WITH TIME WINDOWS : タイムウィンドウ付き2段階配車配送計画に関する遺伝的アプローチ.” 2015. Thesis, Kyoto University / 京都大学. Accessed March 08, 2021. http://hdl.handle.net/2433/202695 ; http://dx.doi.org/10.14989/doctor.k19290.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Manasanan, Titapunyapat. “A GENETIC APPROACH FOR TWO-ECHELON CAPACITATED VEHICLE ROUTING AND SCHEDULING PROBLEM WITH TIME WINDOWS : タイムウィンドウ付き2段階配車配送計画に関する遺伝的アプローチ.” 2015. Web. 08 Mar 2021.

Vancouver:

Manasanan T. A GENETIC APPROACH FOR TWO-ECHELON CAPACITATED VEHICLE ROUTING AND SCHEDULING PROBLEM WITH TIME WINDOWS : タイムウィンドウ付き2段階配車配送計画に関する遺伝的アプローチ. [Internet] [Thesis]. Kyoto University / 京都大学; 2015. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/2433/202695 ; http://dx.doi.org/10.14989/doctor.k19290.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Manasanan T. A GENETIC APPROACH FOR TWO-ECHELON CAPACITATED VEHICLE ROUTING AND SCHEDULING PROBLEM WITH TIME WINDOWS : タイムウィンドウ付き2段階配車配送計画に関する遺伝的アプローチ. [Thesis]. Kyoto University / 京都大学; 2015. Available from: http://hdl.handle.net/2433/202695 ; http://dx.doi.org/10.14989/doctor.k19290

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Pretoria

23. Moolman, A.J. (Alwyn Jakobus). Design of a selective parallel heuristic algorithm for the vehicle routing problem on an adaptive object model.

Degree: Industrial and Systems Engineering, 2010, University of Pretoria

 The Vehicle Routing Problem has been around for more than 50 years and has been of major interest to the operations research community. The VRP… (more)

Subjects/Keywords: Multiple time windows; Multiple constraints; Tabu search; Ant system; Memetic algorithm; Hyper-heuristics; Meta-heuristics; Vehicle routing problem; Supply chain management; Compatibility matrix; Parallel; UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Moolman, A. J. (. (2010). Design of a selective parallel heuristic algorithm for the vehicle routing problem on an adaptive object model. (Doctoral Dissertation). University of Pretoria. Retrieved from http://hdl.handle.net/2263/29598

Chicago Manual of Style (16th Edition):

Moolman, A J (Alwyn. “Design of a selective parallel heuristic algorithm for the vehicle routing problem on an adaptive object model.” 2010. Doctoral Dissertation, University of Pretoria. Accessed March 08, 2021. http://hdl.handle.net/2263/29598.

MLA Handbook (7th Edition):

Moolman, A J (Alwyn. “Design of a selective parallel heuristic algorithm for the vehicle routing problem on an adaptive object model.” 2010. Web. 08 Mar 2021.

Vancouver:

Moolman AJ(. Design of a selective parallel heuristic algorithm for the vehicle routing problem on an adaptive object model. [Internet] [Doctoral dissertation]. University of Pretoria; 2010. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/2263/29598.

Council of Science Editors:

Moolman AJ(. Design of a selective parallel heuristic algorithm for the vehicle routing problem on an adaptive object model. [Doctoral Dissertation]. University of Pretoria; 2010. Available from: http://hdl.handle.net/2263/29598


Kyoto University

24. Sattrawut, Ponboon. EXACT SOLUTIONS FOR LOCATION-ROUTING PROBLEMS WITH TIME WINDOWS USING BRANCH-AND-PRICE METHOD .

Degree: 2015, Kyoto University

Subjects/Keywords: Location-Routing Problem; Time Windows; Branch-and-Price; Column Generation; Labeling Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sattrawut, P. (2015). EXACT SOLUTIONS FOR LOCATION-ROUTING PROBLEMS WITH TIME WINDOWS USING BRANCH-AND-PRICE METHOD . (Thesis). Kyoto University. Retrieved from http://hdl.handle.net/2433/202692

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sattrawut, Ponboon. “EXACT SOLUTIONS FOR LOCATION-ROUTING PROBLEMS WITH TIME WINDOWS USING BRANCH-AND-PRICE METHOD .” 2015. Thesis, Kyoto University. Accessed March 08, 2021. http://hdl.handle.net/2433/202692.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sattrawut, Ponboon. “EXACT SOLUTIONS FOR LOCATION-ROUTING PROBLEMS WITH TIME WINDOWS USING BRANCH-AND-PRICE METHOD .” 2015. Web. 08 Mar 2021.

Vancouver:

Sattrawut P. EXACT SOLUTIONS FOR LOCATION-ROUTING PROBLEMS WITH TIME WINDOWS USING BRANCH-AND-PRICE METHOD . [Internet] [Thesis]. Kyoto University; 2015. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/2433/202692.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sattrawut P. EXACT SOLUTIONS FOR LOCATION-ROUTING PROBLEMS WITH TIME WINDOWS USING BRANCH-AND-PRICE METHOD . [Thesis]. Kyoto University; 2015. Available from: http://hdl.handle.net/2433/202692

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Kyoto University

25. Manasanan, Titapunyapat. A GENETIC APPROACH FOR TWO-ECHELON CAPACITATED VEHICLE ROUTING AND SCHEDULING PROBLEM WITH TIME WINDOWS .

Degree: 2015, Kyoto University

Subjects/Keywords: 2-Echelon Vehicle Routing Problem; Time Windows; Genetic Algorithms; Scheduling Problem; City Logistics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Manasanan, T. (2015). A GENETIC APPROACH FOR TWO-ECHELON CAPACITATED VEHICLE ROUTING AND SCHEDULING PROBLEM WITH TIME WINDOWS . (Thesis). Kyoto University. Retrieved from http://hdl.handle.net/2433/202695

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Manasanan, Titapunyapat. “A GENETIC APPROACH FOR TWO-ECHELON CAPACITATED VEHICLE ROUTING AND SCHEDULING PROBLEM WITH TIME WINDOWS .” 2015. Thesis, Kyoto University. Accessed March 08, 2021. http://hdl.handle.net/2433/202695.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Manasanan, Titapunyapat. “A GENETIC APPROACH FOR TWO-ECHELON CAPACITATED VEHICLE ROUTING AND SCHEDULING PROBLEM WITH TIME WINDOWS .” 2015. Web. 08 Mar 2021.

Vancouver:

Manasanan T. A GENETIC APPROACH FOR TWO-ECHELON CAPACITATED VEHICLE ROUTING AND SCHEDULING PROBLEM WITH TIME WINDOWS . [Internet] [Thesis]. Kyoto University; 2015. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/2433/202695.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Manasanan T. A GENETIC APPROACH FOR TWO-ECHELON CAPACITATED VEHICLE ROUTING AND SCHEDULING PROBLEM WITH TIME WINDOWS . [Thesis]. Kyoto University; 2015. Available from: http://hdl.handle.net/2433/202695

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Pontifical Catholic University of Rio de Janeiro

26. [No author]. [pt] ROTEAMENTO DE NAVIOS NO PROCESSO DE ALÍVIO DE PLATAFORMAS DE PETRÓLEOS PARA EXPORTAÇÃO.

Degree: 2020, Pontifical Catholic University of Rio de Janeiro

[pt] Este trabalho apresenta uma aplicação prática do roteamento de navios com coleta-e-entrega e janelas de tempo para o alívio de plataformas de petróleos para… (more)

Subjects/Keywords: [pt] ROTEAMENTO DE NAVIOS; [pt] JANELAS DE TEMPO; [pt] COLETA-E-ENTREGA; [en] SHIP ROUTING; [en] TIME WINDOWS; [en] PICKUP-AND-DELIVERY

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

author], [. (2020). [pt] ROTEAMENTO DE NAVIOS NO PROCESSO DE ALÍVIO DE PLATAFORMAS DE PETRÓLEOS PARA EXPORTAÇÃO. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=50728

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

author], [No. “[pt] ROTEAMENTO DE NAVIOS NO PROCESSO DE ALÍVIO DE PLATAFORMAS DE PETRÓLEOS PARA EXPORTAÇÃO.” 2020. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed March 08, 2021. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=50728.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

author], [No. “[pt] ROTEAMENTO DE NAVIOS NO PROCESSO DE ALÍVIO DE PLATAFORMAS DE PETRÓLEOS PARA EXPORTAÇÃO.” 2020. Web. 08 Mar 2021.

Vancouver:

author] [. [pt] ROTEAMENTO DE NAVIOS NO PROCESSO DE ALÍVIO DE PLATAFORMAS DE PETRÓLEOS PARA EXPORTAÇÃO. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2020. [cited 2021 Mar 08]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=50728.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

author] [. [pt] ROTEAMENTO DE NAVIOS NO PROCESSO DE ALÍVIO DE PLATAFORMAS DE PETRÓLEOS PARA EXPORTAÇÃO. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2020. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=50728

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

27. Jeong, Kyungsoo. Routing and Scheduling Problems of Container Trucks in a Shared Resource Environment.

Degree: Civil Engineering, 2017, University of California – Irvine

 More frequent vehicle movements are required for moving containers in a local area due to low unit volume that a single vehicle can handle compared… (more)

Subjects/Keywords: Transportation; Asymmetric Traveling Salesman Problem; Container Truck Operations; Resource Sharing; Variable Neighborhood Search; Vehicle Routing and Scheduling Problem with Time Windows

…vehicle routing problem with time windows (VRPTW) – were adopted to address the… …other general tasks’ time windows. a) Stay-with (no decoupling allowed) b… …traveled with a container were fixed. By considering multiple vehicles and time windows, Wang and… …66 Figure 3-1 Overall process of the container truck routing problem with collaboration… …79 Figure 3-2. Example of a selective container truck routing problem with collaboration… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Jeong, K. (2017). Routing and Scheduling Problems of Container Trucks in a Shared Resource Environment. (Thesis). University of California – Irvine. Retrieved from http://www.escholarship.org/uc/item/639590j3

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Jeong, Kyungsoo. “Routing and Scheduling Problems of Container Trucks in a Shared Resource Environment.” 2017. Thesis, University of California – Irvine. Accessed March 08, 2021. http://www.escholarship.org/uc/item/639590j3.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Jeong, Kyungsoo. “Routing and Scheduling Problems of Container Trucks in a Shared Resource Environment.” 2017. Web. 08 Mar 2021.

Vancouver:

Jeong K. Routing and Scheduling Problems of Container Trucks in a Shared Resource Environment. [Internet] [Thesis]. University of California – Irvine; 2017. [cited 2021 Mar 08]. Available from: http://www.escholarship.org/uc/item/639590j3.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jeong K. Routing and Scheduling Problems of Container Trucks in a Shared Resource Environment. [Thesis]. University of California – Irvine; 2017. Available from: http://www.escholarship.org/uc/item/639590j3

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ)

28. Αϋφαντοπούλου, Γεωργία. Εφαρμογή έμπειρων τεχνικών και συστημάτων στο βέλτιστο σχεδιασμό δρομολογίων οχημάτων στόλου διανομής.

Degree: 2001, Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ)

 Στην παρούσα Διδακτορική Διατριβή εξετάσθηκε η εφαρμογή έμπειρων τεχνικών σε συνδυασμό με σύγχρονες μεθόδους βελτιστοποίησης, όπως οι Αλγόριθμοι Γενετικής Αναζήτησης, στο βέλτιστο σχεδιασμό δρομολογίων οχημάτων… (more)

Subjects/Keywords: Δρομολόγηση στόλου; Αλγόριθμοι, Γενετικοί; Έμπειρα συστήματα; Έμπειρες τεχνικές; Δρομολόγηση με χρονοπαράθυρα; Θαλάσσιες μεταφορές; Ακτοπλοία; Routing; Scheduling; Algorithms, Genetic; Expert systems; Expert techniques; Distribution with time windows; Maritime transport; Short sea shipping

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Αϋφαντοπούλου, . . (2001). Εφαρμογή έμπειρων τεχνικών και συστημάτων στο βέλτιστο σχεδιασμό δρομολογίων οχημάτων στόλου διανομής. (Thesis). Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ). Retrieved from http://hdl.handle.net/10442/hedi/15176

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Αϋφαντοπούλου, Γεωργία. “Εφαρμογή έμπειρων τεχνικών και συστημάτων στο βέλτιστο σχεδιασμό δρομολογίων οχημάτων στόλου διανομής.” 2001. Thesis, Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ). Accessed March 08, 2021. http://hdl.handle.net/10442/hedi/15176.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Αϋφαντοπούλου, Γεωργία. “Εφαρμογή έμπειρων τεχνικών και συστημάτων στο βέλτιστο σχεδιασμό δρομολογίων οχημάτων στόλου διανομής.” 2001. Web. 08 Mar 2021.

Vancouver:

Αϋφαντοπούλου . Εφαρμογή έμπειρων τεχνικών και συστημάτων στο βέλτιστο σχεδιασμό δρομολογίων οχημάτων στόλου διανομής. [Internet] [Thesis]. Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ); 2001. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/10442/hedi/15176.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Αϋφαντοπούλου . Εφαρμογή έμπειρων τεχνικών και συστημάτων στο βέλτιστο σχεδιασμό δρομολογίων οχημάτων στόλου διανομής. [Thesis]. Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ); 2001. Available from: http://hdl.handle.net/10442/hedi/15176

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

29. Celikbilek, Can. Alternative Supply Chain Design Strategies with Operational Considerations: A Case Study for a Windows Manufacturing Company.

Degree: PhD, Industrial and Systems Engineering (Engineering and Technology), 2016, Ohio University

 This dissertation aims to fulfill the gap of designing the supply chain system as a whole and looking at overall design across the supply chain… (more)

Subjects/Keywords: Engineering; Industrial Engineering; Operations Research; Supply Chain Design and Optimization; Demand Management Strategy; Mathematical Modeling; Heuristics; Facility Location; Cellular Manufacturing; Vehicle Routing with Time Windows

…90 Review on Vehicle Routing Problem with Time Windows (VRPTW) ........ 93… …Vehicle Routing Decisions with Time Windows… …124 7.1.1 Mathematical Model for Vehicle Routing Problem with Time Windows.. 124 11 7.1.2… …Heuristic for the Vehicle Routing Problem with tight Time Windows and Limited Working Times… …Portage Plant ............... 178 8.1.10 Daily Vehicle Routing Decisions with Time Windows… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Celikbilek, C. (2016). Alternative Supply Chain Design Strategies with Operational Considerations: A Case Study for a Windows Manufacturing Company. (Doctoral Dissertation). Ohio University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1458302171

Chicago Manual of Style (16th Edition):

Celikbilek, Can. “Alternative Supply Chain Design Strategies with Operational Considerations: A Case Study for a Windows Manufacturing Company.” 2016. Doctoral Dissertation, Ohio University. Accessed March 08, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1458302171.

MLA Handbook (7th Edition):

Celikbilek, Can. “Alternative Supply Chain Design Strategies with Operational Considerations: A Case Study for a Windows Manufacturing Company.” 2016. Web. 08 Mar 2021.

Vancouver:

Celikbilek C. Alternative Supply Chain Design Strategies with Operational Considerations: A Case Study for a Windows Manufacturing Company. [Internet] [Doctoral dissertation]. Ohio University; 2016. [cited 2021 Mar 08]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1458302171.

Council of Science Editors:

Celikbilek C. Alternative Supply Chain Design Strategies with Operational Considerations: A Case Study for a Windows Manufacturing Company. [Doctoral Dissertation]. Ohio University; 2016. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1458302171

30. Liu, Yihan. Optimisation de problème de tournées de véhicules de service à domicile : Optimization of vehicle routing problem for field service.

Degree: Docteur es, Automatique, Génie Informatique, Traitement du Signal et des Images, 2017, Ecole centrale de Lille

La performance logistique des entreprises et l’optimisation des transports sont devenues un grand problème ces dernières années. La planification et l’optimisation des services constituent en… (more)

Subjects/Keywords: Problème de tournées des véhicules; Multi-dépôt; Multi-période; Algorithme génétique; Fenêtres de temps; Tournées de service; Heuristiques; Vehicle routing problem; Multi-depot; Multi-period; Genetic algorithm; Time windows; Service routing; Heuristics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Liu, Y. (2017). Optimisation de problème de tournées de véhicules de service à domicile : Optimization of vehicle routing problem for field service. (Doctoral Dissertation). Ecole centrale de Lille. Retrieved from http://www.theses.fr/2017ECLI0009

Chicago Manual of Style (16th Edition):

Liu, Yihan. “Optimisation de problème de tournées de véhicules de service à domicile : Optimization of vehicle routing problem for field service.” 2017. Doctoral Dissertation, Ecole centrale de Lille. Accessed March 08, 2021. http://www.theses.fr/2017ECLI0009.

MLA Handbook (7th Edition):

Liu, Yihan. “Optimisation de problème de tournées de véhicules de service à domicile : Optimization of vehicle routing problem for field service.” 2017. Web. 08 Mar 2021.

Vancouver:

Liu Y. Optimisation de problème de tournées de véhicules de service à domicile : Optimization of vehicle routing problem for field service. [Internet] [Doctoral dissertation]. Ecole centrale de Lille; 2017. [cited 2021 Mar 08]. Available from: http://www.theses.fr/2017ECLI0009.

Council of Science Editors:

Liu Y. Optimisation de problème de tournées de véhicules de service à domicile : Optimization of vehicle routing problem for field service. [Doctoral Dissertation]. Ecole centrale de Lille; 2017. Available from: http://www.theses.fr/2017ECLI0009

[1] [2] [3] [4] [5] … [1459]

.