subject:(routing with time windows)

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

URL: http://repository.asu.edu/items/35422

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: https://doi.org/10.26174/thesis.lboro.8319731.v1 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.785257

► 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)

▼ 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 and travel times are subject to stochastic events. There is an agreed time window for starting each service task. The risk of missing the time window for a task is defined as the probability that the technician assigned to the task arrives at the customer site later than the time window. The problem is to generate a schedule that minimises the maximum of risks and the sum of risks of all the tasks considering the effect of skill levels and task priorities. A new approach is taken to build schedules that minimise the risks of missing appointments as well as the risks of technicians not being able to complete their daily tours on time. We first analyse the probability distribution of the arrival time to any customer location considering the distributions of activities prior to this arrival. Based on the analysis, an efficient estimation method for calculating the risks is proposed, which is highly accurate and this is verified by comparing the results of the estimation method with a numerical integral method. We then develop three new workforce scheduling and vehicle routing models that minimise the risks with different considerations such as an identical standard deviation of the duration for all uncertain tasks in the linear risk minimisation model, and task priorities in the priority task risk minimisation model. A simulated annealing algorithm is implemented for solving the models at the start of the day and for re-optimisation during the day. Computational experiments are carried out to compare the results of the risk minimisation models with those of the traditional travel cost model. The performance is measured using risks and robustness. Simulation is used to compare the numbers of missed appointments and test the effect of re-optimisation. The results of the experiments demonstrate that the new models significantly reduce the risks and generate schedules with more contingency time allowances. Simulation results also show that re-optimisation reduces the number of missed appointments significantly. The risk calculation methods and risk minimisation algorithm are applied to a real-world problem in the telecommunication sector.

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://www.escholarship.org/uc/item/9rk7994k

► 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)

▼ 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 strong foundation for maintaining the network state at all times. It needs to have a robust platform that performs its functions from small or large topologies alike.This thesis describes the extensions made to the database access layer of the MINA. Modifications were made to the database schema as well as the database capture layer to capture these periodic or intermittent changes of the network state. We tested the modifications so that MINA scales to handle a large topology. We have also enhanced the runtime component and show that an in-memory representation of the multi-network provides very predictable responses to network path queries. MINA can now use the runtime enhancements made and provide accurate predictions of the network bottlenecks and accurately predict other what-if scenarios. In order to perform a more realistic test on the code changes, we used publicly available datasets. Node mobility information was captured at single-second intervals observed from an access point. We successfully tested the capability to handle large volumes of changes to the network. We then generated data for larger topologies as well as large batches of changes to network state to see how the modifications handle such stresses. We measured the time taken to persist such large volumes of changes.This gives us an idea of the frequency of changes that MINA can accommodate.We then show one possible extension of MINA. We propose a suitable deployment for emergency response in a shanty town. We assume that we instrument the entire area of the shanty town with low-cost sensors capable of capturing local parameters like air quality, smoke, temperature etc. Additional network components like mobile nodes and fixed access points or routers perform the task of capturing any relevant sensor data and routing it to a central location (like an Incident Response Center) for further action. We discuss an extension where the mobile nodes are assigned a path on a road network thus directing the mobility. We present efficient techniques to assign a path to these nodes so that the time taken to capture the data from sensor nodes is minimized. We formulate the task as a Dynamic Vehicle Routing Problem with Time Windows constraints which is NP-hard. We present heuristic based algorithms to generate an efficient path for such mobile nodes.We show how such potential extensions can be incorporated into the MINA design framework to solve real-world problems.

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://hdl.handle.net/10012/16136

► 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)

▼ 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 and the evolvement in vehicle-to-grid (V2G) techniques in the past decade. Under appropriate management of EV charging and discharging, the current grid capacity can satisfy the energy requirements of a considerable number of EVs and EVs could help enhance grid reliability and stability through ancillary service provision. In this thesis, we investigate the operational strategies of commercial EV fleets under the V2G context where energy price signals are utilized to incentivize EV owners to time-shift charging schedule and discharging EVs during peak hours. We propose and formulate a new EV routing problem with time windows under time-variant electricity prices (EVRPTW-TP), considering practical constraints of commercial EV fleets providing logistic services and optimizing over its overall electricity cost. In order to solve the EVRPTW-TP, we then formulate a Lagrangian relaxation as well as a variable neighborhood search and tabu search hybrid (VNS/TS) heuristic to approximate the optimal solution from below and above respectively. Our numerical experiments on small instances suggest that both algorithms are able to provide high quality bounds to the EVRPTW-TP. The VNS/TS heuristic outperforms CPLEX in terms of solution quality and efficiency on instances of 10 or more customers. In addition, we utilize the VNS/TS heuristic to study a use case of an EV fleet providing grocery delivery service in the Kitchener and Waterloo (KW) region in Ontario, Canada. Insights about the impacts of energy pricing scheme, service time slot design as well as fleet size are presented. Finally, as the first step towards implementing advanced machine learning techniques to solve the EVRPTW-TP, we develop a reinforcement learning (RL) model for the electric vehicle routing problem with time windows (EVRPTW) and provide computational results to assess the performance of the RL model.

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: https://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/13462

►

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)

▼

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 obtenção de rotas de distribuição de produtos e a recolha de paletes, bem como a aferição das atualmente utilizadas. Inicialmente, o estágio visou o conhecimento do funcionamento de uma organização, bem-sucedida, como "A Padaria Portuguesa", com especial foco no tipo de infraestrutura. Este período, utilizado para a recolha de dados necessários à resolução do problema em mão, foi também crucial para entender todos os processos utilizados na distribuição e os vários fatores a ter em conta no carregamento/descarregamento dos veículos, na recolha de paletes e no acesso às lojas. O problema proposto é então categorizado como um misto entre o SPDPTW ("Simultaneous Pickup and Delivery Problems with Time Windows") e o DFPSPTW ("Delivery first, Pickup second Problems with Time Windows"). Esta variação encontra-se ainda pouco desenvolvida pela comunidade científica, o que dificultou o processo de enquadramento e abordagem necessários ao estudo. Assim, o facto de se estar a considerar um novo problema, aliado à necessidade de desenvolver um software que possa vir a ser utilizado na empresa, levou ao desenvolvimento de uma nova heurística construtiva. Este software, em linguagem VBA, apresenta diversas funcionalidades e grande potencial resultante de um esforço conjunto entre o autor e a respetiva organização. A última fase será reservada para testes computacionais e para a análise dos respetivos resultados, numa medida de aferir mais facilmente, a qualidade do software desenvolvido.

This study is made under an internship in the organization "A Padaria Portuguesa" and its main objective is the identification of routes to the distribution of products and to the collection of pallets. Initially, the internship aimed at understanding the way that a successful organization, as the "A Padaria Portuguesa", works, with special focus on the type of infrastructure. This period, used for gathering the necessary data to the resolution of the problem in hand, was also crucial to better understand the current processes regarding the distribution as well as constraints to consider in the loading and unloading of the vehicles or in the collection of pallets. The proposed problem is then categorized as a mix between the "Simultaneous Pickup and Delivery Problems with Time Windows " and the "Delivery first, Pickup second Problems with Time Windows". This generalization of the Vehicle Routing Problem still lacks the attention of the scientific community, which mired the study framework and the choice of the approaches to follow. The development of a new constructive heuristic is thus motivated from two facts: i) a new problem is being considered; and ii) the need of the company for a software that can be used. This software, programmed in VBA, has many features and great potential resulting from a joint effort between the author and the respective organization. The last…

Advisors/Committee Members: Mourão, Maria Cândida, Mateus, Ricardo.

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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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); Οικονομικό Πανεπιστήμιο Αθηνών

URL: http://hdl.handle.net/10442/hedi/40978

►

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)

▼

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 the application of the Vendor Managed Inventory (VMI) concept, where the supplier (vendor) has to make inventory and routing decisions simultaneously for a given planning horizon. This thesis focuses on a scenario where a single-product type has to be delivered by a fleet of capacitated homogenous vehicles and housed at a depot over a finite and discrete planning horizon. The demand is fully available to the decision maker (supplier) at the beginning of the planning horizon, stock-outs are not allowed, and transportation costs and inventory holding costs of customers are taken into account in the objective function. Due to the NP-hard nature of the IRP, it is very difficult to develop an exact algorithm that can solve large-scale problems within a reasonable computation time. As an alternative, a hybrid evolutionary optimization algorithm based on two well-known meta-heuristics, the Genetic Algorithm and the Simulated Annealing Algorithm, is presented to handle the IRP. Namely, the Genetic Algorithm is related to the planning phase, while the Simulated Annealing Algorithm is associated with the routing phase. A repetitive procedure, containing characteristics from both referred meta-heuristics, is applied to obtain a near-optimal feasible solution. Testing instances with different properties are established to investigate algorithmic performance, and the computational results are then reported. Finally, a two-phase solution algorithm is presented to handle an extension of the IRP, the Inventory Routing Problem with Time Windows (IRPTW). The IRPTW, which has not been excessively researched in the literature, is a generalization of the standard IRP involving the added complexity that every customer should be served within a given time window. Α single-product type has to be delivered by a fleet of capacitated homogenous vehicles and housed at a depot over a finite and discrete planning horizon. The demand is fully available to the decision maker (supplier) at the beginning of the planning horizon, stock-outs are not allowed, and only transportation costs are taken into account in the objective function. The proposed two-phase solution algorithm is based on (a) a simple simulation for the planning phase and (b) the Variable Neighborhood Search Algorithm (VNS) for the routing phase. The computational study underscores the importance of integrating the inventory and vehicle routing decisions. Analytical results and graphic presentation formats are provided to convey meaningful insights into the problem.

Στόχος της παρούσας διατριβής είναι η παρουσίαση αλγοριθμικών προσεγγίσεων για την επίλυση του Προβλήματος Δρομολόγησης Αποθεμάτων (Inventory Routing Problem, IRP) και του Προβλήματος Δρομολόγησης Αποθεμάτων με Χρονικά Παράθυρα (Inventory Routing Problem with Time Windows, IRPTW). Τα ανωτέρω προβλήματα πηγάζουν από την προσέγγιση της Διαχείρισης Αποθεμάτων από…

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://repository.asu.edu/items/49355

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://documentodegrado.uniandes.edu.co/documentos/Duque_OPTW_05302013.pdf

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-186248

►

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)

▼

In this thesis, the vehicle routing problem with stochastic, and time dependent, travel times is studied. The stochastic travel times are estimated from historical drive data. The variation of the drive times, as well as that of the variance, during the day was modeled. The purpose of the thesis was to propose a method of handling the congestion related traffic impediments in an urban setting. Since the majority of times of delivery in the empirical test cases studied correlate with the time period of high traffic load, an efficient and robust handling of such traffic scenarios is of high importance. It is shown that the stochastic models will shift the estimated arrivals to customers from the more volatile early and late extremes to more central regions of the time window. Previously delivered routes were evaluated both with the standard algorithm and the proposed stochastic algorithm. The difference between the actual drive times and the calculated drive times were analyzed by studying the correlation of the drive times between each customer in the route. It was shown that the routes of the proposed stochastic method increased this correlation. The drive times between nodes where also perturbed with a Gamma distributed noise. The results from the stochastic algorithm showed higher resilience to this disturbance than did the deterministic models.

I detta examensarbete har fordonsruttningsproblemet, VRP, med stokastiska och tidsberonds körtider behandlöats. De stokastiska körtiderna har estimerats från tidigare insamlad hasighetsdata. Modeller för körtidernas och variansernas förändring under dagen har tagits fram. Syftet med examensarbetet var att föreslå en metod för hur påverkan på körtider av förutsägbar trafikträngsel i en urban trafikmiljö kan hanteras. Eftersom huvuddelen av alla leveranser sammanfaller med de tider på dygnet då trafikbelastning är som högst, ar är en effektiv och robust metod för att hantera sådana störningar av stor vikt. Det visas att den stokastiska modellen kommer att förflyttar ankomster från början och slutet av tidsfönstret till den mer okänsliga mittregionen. Tidigare, utförda leveranser studerades både med den ursprungliga deterministiska modellen och här framtagna stokastiska modellen. Skillnaden mellan de två analyserades genom att studera korrelationen mellan körtiderna som de beräknats av de två modellerna och de upmätta tiderna som de loggats av leveransfordonen. Det visas att korrelationen mellan körtiderna mellan de stokastiska körtiderna och de verkliga körtiderna är högre än korrelationen mellan de deterministiska körtiderna och de verkliga. Rutterna som föreslagits av den stokastiska modellen var också mer tlig mot störningar.

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://othes.univie.ac.at/55323/

►

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)

▼

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 Entscheidungen für Warenlieferungen in Stadtzentren und Einkaufsstraßen darstellen, während Verkehrsbedingungen und -infrastrukturen zeitliche und räumliche Grenzen für Lieferprozesse setzen. Der Datensatz enthält einen Pool von Kunden, die Lieferungen von mehreren Trägerunternehmen erhalten. Der Versuch, diese Lieferungen zu synchronisieren soll die Wartezeiten der Kunden zwischen den Lieferungen verringern und damit ein besseres Timing gewährleisten. Zunächst wird eine Literaturrecherche über das VRP in der Stadtlogistik mit dem Schwerpunkt Synchronisierung vorgestellt. Zweitens be-schreiben wir unseren Algorithmus mit Lösungen für das VRP mit Synchronisationsbedin-gungen, die von (Sarasola & Doerner, 2018) formuliert wurden. Die meisten Komponenten des Algorithmus stammen von einem Penalty-basierten Edge Assembly Memetic-Algorithmus für das VRP mit Zeitfenstern, die von (Nagata et al., 2010) vorgeschlagen wur-den. Im letzten Kapitel werden Experimente zur Parametereinstellung und Lösungen für zwei Gruppen von Instanzen vorgestellt, die auf realen Daten in der Stadt Linz, Österreich, erstellt wurden.

In this thesis, a metaheuristic approach to solve a vehicle routing problem with synchronization constraints (VRPSC) in city logistics is presented. The algorithm generates solutions that represent decisions for goods deliveries in city centers and shopping streets whereas traffic conditions and infrastructure put time and place limits for delivery processes. The data set includes a pool of customers that receive deliveries from several carriers. The attempt to syn-chronize these deliveries shall decrease waiting times of customers between deliveries pre-serving better timing. First, literature review is presented on the VRP in city logistics with focus on synchronization. Second, we describe our algorithm with solutions to the VRPSC formulated by (Sarasola & Doerner, 2018). Most of the components of the algorithm stem from a penalty-based edge assembly memetic algorithm for the VRP with time windows pro-posed by (Nagata, Bräysy, & Dullaert, 2010). Experiments for parameters setting and solutions for two groups of instances generated on real-life data in the city of Linz, Austria, are presented in the last chapter.

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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://resolver.tudelft.nl/uuid:d77656e3-e451-4a11-84ce-9740be96759d

►

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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://hdl.handle.net/1853/19698

► 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)

▼ 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 a sea-cargo shipping company and a railroad company. For the work in sea-cargo routing and scheduling, we focus on the tramp shipping operation. Tramp shipping is a demand-driven type of shipping operation which does not have fixed schedules. The schedules are based on the pickup and download locations of profitable service requests. Given set of products distributed among a set of ports, with each product having pickup and download time windows and a destination port, the problem is to find the schedule for a fleet of ships that maximizes profit over a specified time horizon. The problem is modeled as a Mixed Integer Non-Linear Program and reformulated as an equivalent Mixed Integer Linear Program. Three heuristic methods, along with computational results, are presented. We also exploit the special structure enjoyed by our model and introduce an upper-bounding problem to the model. With a little modification, the model is readily extendable to reflect soft time windows and inter-ship cargo-transfers. The other part of our work deals with train routing and scheduling. A typical train shipment consists of a set of cars having a common origin and destination. To reduce the handling of individual shipments as they travel, shipments are grouped into blocks. The problem is that given sets of blocks to be carried from origins to destinations, construct the most cost effective train routes and schedules and determine block-to-train assignments, such that the number of block transfers (block swaps) between trains, the number of trains used, and some other cost measures are minimized. Incorporating additional precedence requirements, the modeling techniques from the shipping research are employed to formulate a mixed integer nonlinear program for this train routing and scheduling problem. Computational results are presented. Advisors/Committee Members: Al-Khayyal, Faiz (Committee Chair), Barnes, Earl (Committee Member), Johnson, Ellis (Committee Member), Karimi, IA (Committee Member), Sokol, Joel (Committee Member).

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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://hdl.handle.net/11343/54610

► 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)

▼ 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 with Time Windows (SOP-TW) can arise as a subproblem of these crane operations. The SOP-TW corresponds to the task of scheduling a single crane to move a set of containers, where each container has: a fixed pick-up location; a fixed drop-off location; a time window during which the container must be picked up and moved to its destination; and some container movements must be performed before other container movements. A crane schedule is a list showing the pick-up time of each container. If time permits, a crane is allowed to sit idle between moving containers; however, once a container is collected from its pick-up location it must be delivered to its drop-off location. Consequently, the order of the container movements and a path for the crane can be determined from the schedule. For this application the aim is to minimise the total time the crane spends moving while not carrying a container, that is, the total time moving from the drop-off location of one container movement to the pick-up location of the next container movement. The SOP-TW can be viewed in more general terms as the problem of scheduling n jobs on a single machine with sequence-dependent setup times, generalised precedence constraints between some pairs of jobs and start time windows, where the objective is to minimise the sum of all setup times; the jobs are container moves and the setup time is the time needed for a crane to move from the drop-off location for one job to the pick-up location for the next. A detailed critique of existing SOP-TW data generators and their resulting data sets is undertaken and reveals a lack of available, feasible, difficult SOP-TW problem instances for testing methods for solving the SOP-TW. This motivates the development of a comprehensive port-specific data generator for creating feasible SOP-TW problem instances, and a variety of interesting SOP-TW instances are constructed. Importantly, the underlying methodology of this new generator is sufficiently general to be easily adapted for non-port settings. Three existing formulations for the Asymmetric Travelling Salesman Problem with Time Windows (ATSP-TW) are extended to model the SOP-TW. An efficient preprocessing routine that simultaneously addresses both time windows and precedence relations is given that ultimately reduces the size of the mixed integer programming (MIP) models implemented. A computational study of the two compact MIPs is performed to provide a baseline for comparison. Three techniques for solving the SOP-TW are identified and investigated: * a construction heuristic for generating feasible solutions; * an IP-based heuristic for generating feasible solutions; and * a scheduling approach embedded within a branch-and-bound framework. A series of comprehensive computational studies are performed to investigate the effectiveness of these techniques against…

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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://www.rcaap.pt/detail.jsp?id=oai:repositorio.ul.pt:10451/24881

►

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)

▼

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 intervalo de tempo previamente conhecido, o Traveling Salesman Problem with Time Windows (TSPTW) consiste em determinar uma rota de custo mínimo, com início e fim num depósito, garantindo que todos os clientes sejam visitados na respetiva janela temporal. São conhecidos os clientes a servir, os custos e tempos de deslocação entre cada par de clientes e entre cada cliente e o depósito, os tempos de serviço e a janela temporal de cada cliente, bem como o tempo e distância máxima da rota. A rota tem associado um custo resultante da soma dos custos de deslocação. Existem diversas variantes do problema, pelo que nesta dissertação são estudadas as variantes do TSPTW com vista à minimização da distância total percorrida com tempos de espera, minimização da duração da rota com e sem possibilidade de tempos de espera, no caso de o veículo chegar ao cliente antes do início da respetiva janela temporal. Para cada problema, é considerado uma variação da amplitude das janelas temporais de cada cliente a ser visitado. O TSPTW pertence à classe de problemas NP-difícil, por ser uma extensão do clássico TSP. Na presente dissertação são propostos dois modelos para o TSPTW: um modelo baseado nas restrições de Miller-Tucker-Zemlin (MTZ) e um outro Modelo de Fluxo Agregado (MFA). Pretende-se comparar os modelos propostos na resolução de problemas para as diversas variantes em estudo, bem como a comparação da qualidade da correspondente relaxação linear. Para comparar os modelos propostos, foram utilizadas instâncias de referência da literatura. Com um número de clientes a variar entre 20 a 200 e com diferentes amplitudes de janelas temporais para cada problema, os métodos utilizados permitiram resolver os problemas, em que não era conhecido o seu valor ótimo.

Given a set of customers who need to be visited in a previously known time window, the Traveling Salesman Problem with Time Windows (TSPTW) is to determine a minimum cost route, starting and ending in a depot, ensuring that all customers are visited in the them time window. All customers to serve are known, cost and travel times between each pair of customers and between each customer and the depot, service times and the time window of each client, as well as the maximum time and route distance. The route has an associated cost, resulting from the sum of the travel costs. There are several variants of the problem, so this thesis is to studied TSPTW variants with goal to minimizing the total distance traveled with waiting times, minimizing the duration of the route with and without possibility of waiting times, in case of the vehicle reach the client before the start of respective time window. For each problem, it is considered a variation of the length of time windows of each client to be visited. The TSPTW belongs to the class of NP-hard problems, being an extension of the classic TSP. In this…

Advisors/Committee Members: Gouveia, Luís, 1957-, Paias, Ana Maria Duarte Silva Alves, 1963-.

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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://hdl.handle.net/10889/8327

►

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

▼

Στην παρούσα μεταπτυχιακή διπλωματική εργασία μελετήθηκε το πρόβλημα Δρομολόγησης Στόλου Οχημάτων με Παράθυρα Χρόνου (VRPTW) κάτω από ένα φιλικό προς το περιβάλλον πρίσμα που απαιτεί την δημιουργία ισορροπημένων και συμπαγών συστάδων. Παρουσιάζεται μια νέα ευρετική προσέγγιση που αποτελείται από τρεις φάσεις: (i) συσταδοποίηση των πελατών με συμβατά παράθυρα χρόνου, (ii) συσταδοποίηση των πελατών που βρίσκονται γεωγραφικά κοντά χρησιμοποιώντας διάφορες μεθόδους (φυσικές αποκοπές, KaHIP, τετραδικά δένδρα), (iii) μια φάση εκλέπτυνσης που είτε χωρίζει μια συστάδα σε μικρότερες, είτε συγχωνεύει συστάδες δημιουργώντας μια συμπαγή μεγαλύτερη συστάδα. Η νέα προσέγγιση αποδίδει πολύ καλά όταν χρησιμοποιείται σε δυναμικά σενάρια στα οποία ζητούνται αλλαγές στην αρχικά υπολογισμένη διαδρομή (προσθήκη μιας νέας παραγγελίας ή ακύρωση κάποιας παραγγελίας). Η νέα μέθοδος αποτελεί ένα πολύ καλό σημείο εκκίνησης για επανεξέταση και περαιτέρω βελτιστοποίηση της λύσης του προβλήματος Δρομολόγησης Στόλου Οχημάτων με Παράθυρα Χρόνου. Πειράματα που έγιναν με πραγματικά σύνολα δεδομένων δείχνουν ότι η νέα προσέγγιση υπερέχει σε σχέση με τις συνήθεις προσεγγίσεις που ξεκινούν από μία βασική λύση.

We investigate the Vehicle Routing Problem with Time Windows (VRPTW) under a new approach, consisting of three major phases: (i) a first clustering of customers with compatible time windows; (ii) a second clustering of customers with close geographic proximity based on various methods (natural cuts, KaHIP, quad trees); (iii) a refinement phase that either splits a cluster into smaller ones, or merges clusters to form a bigger compact cluster. Our approach turns out to be beneficial when used in an on-line environment, where changes to the initial tour are requested (add a new customer to the tour or drop some customers). The new method serves as a warm starting point for re-evaluating and further optimizing the solution of VRPTW. Experiments with real data sets demonstrate that our approach compares favorably with standard approaches that start from a basic (cold) solution.

Advisors/Committee Members: Ζαρολιάγκης, Χρήστος, Gkortsilas, Dimitrios, Ζαρολιάγκης, Χρήστος, Γαλλόπουλος, Ευστράτιος, Κοντογιάννης, Σπυρίδων.

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

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

Chicago Manual of Style (16^th Edition):

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

MLA Handbook (7^th 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

URL: https://ir.uiowa.edu/etd/1924

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://rave.ohiolink.edu/etdc/view?acc_num=case1057156056

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://hdl.handle.net/11012/53721

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-13836

► 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…

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://upetd.up.ac.za/thesis/available/etd-11192010-165951/

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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 / 京都大学

URL: http://hdl.handle.net/2433/202692 ; http://dx.doi.org/10.14989/doctor.k19287

新制・課程博士

甲第19287号

工博第4084号

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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 : タイムウィンドウ付き２段階配車配送計画に関する遺伝的アプローチ.

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

URL: http://hdl.handle.net/2433/202695 ; http://dx.doi.org/10.14989/doctor.k19290

新制・課程博士

甲第19290号

工博第4087号

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 ; 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 (16^th 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 ; 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 (7^th 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 ; 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 : タイムウィンドウ付き２段階配車配送計画に関する遺伝的アプローチ. [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

URL: http://hdl.handle.net/2263/29598

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://hdl.handle.net/2433/202692

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://hdl.handle.net/2433/202695

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=50728

►

[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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://www.escholarship.org/uc/item/639590j3

► 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)

▼ 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 with vessels and rails involved in the container supply chain. For this reason, truck operations for moving containers significantly affect not only transportation cost itself but also product price. They have inherent operational inefficiencies associated with empty container movements and container processes at facilities such as warehouses, distribution centers and intermodal terminals. One critical issue facing the trucking industry is the pressing need for truck routing plans that reduce such inefficiencies. Hence, this dissertation proposes to apply the concept of sharing resources, which is an emerging economic model, to container truck operations in order to resolve this issue. Two shareable resources – vehicles and containers – are considered.This study extends the literature on routing and scheduling problems that arise from container movements, and examines the possible benefits of sharing resources across customers. A series of truck container routing and scheduling problems were developed by assuming different levels of resource sharing among; (1) customers of one trucking operator, (2) customers across collaborations of multiple operators, and (3) customers over multi-day operations. To enable a trucking company to operate its fleet under a shared resource environment, two operational strategies – street turning and decoupling operations – together with temporal precedence constraints – in addition to the time constraints that are typically included in the vehicle routing problem with time windows (VRPTW) – were adopted to address the proposed problems. Two meta-heuristic algorithms based on a variable neighborhood search (VNS) scheme were developed to solve the proposed problems, including temporal precedence constraints – which are computationally more expensive – for real-world applications. To address flexible time windows resulting from temporal precedence constraints, a novel feasibility check algorithm was developed. Results from a series of numerical experiments confirm that the proposed approach leverages the advantages of resource sharing, and the meta-heuristic algorithms are efficient solution approaches for each problem with the targeted resource sharing. Consequently, this dissertation offers a platform for the development of a decision-support tool for drayage companies by applying three different levels of resource sharing into their operations.

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…

10 more images…

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ)

URL: http://hdl.handle.net/10442/hedi/15176

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

▼ Στην παρούσα Διδακτορική Διατριβή εξετάσθηκε η εφαρμογή έμπειρων τεχνικών σε συνδυασμό με σύγχρονες μεθόδους βελτιστοποίησης, όπως οι Αλγόριθμοι Γενετικής Αναζήτησης, στο βέλτιστο σχεδιασμό δρομολογίων οχημάτων στόλου, κατ’ αντιπαραβολή με τους κλασικούς ευρετικούς κανόνες που προτείνονται για την επίλυση των προβλημάτων αυτών από τη θεωρία της Επιχειρησιακής Έρευνας. Το ιδιαίτερο χαρακτηριστικό της σχετικής έρευνας είναι ότι δεν εστιάζεται σε απλοποιημένες μορφές του προβλήματος (π.χ. πρόβλημα περιφερόμενου πωλητού), που επιδέχονται πολυνομικές λύσεις, αλλά επιχειρεί να προσεγγίσει το πραγματικό πρόβλημα, συμπεριλαμβανομένων χρονικών και άλλων περιορισμών. Το κυριότερο τμήμα της εργασίας εστιάζεται στην επίλυση του προβλήματος δρομολογίων οχημάτων με χρονικούς περιορισμούς (Vehicle Routing Problem with Time Windows - VRPTW), που είναι μη πολυωνυμικό και "σκληρό" (“NP-hard”). Η έρευνα δεν περιορίστηκε μόνο στην εφαρμογή συγκεκριμένων αλγορίθμων βελτιστοποίησης, αλλά εστιάστηκε κυρίως στην προσέγγιση του προβλήματος από τη σκοπιά του έμπειρου προγραμματιστή δρομολογίων, κωδικοποιώντας και εφαρμόζοντας τη συμπεριφορά του για την ανάπτυξη του αρχικού πλήθους, την καθοδήγηση (καθορισμό καινοτόμων μεθόδων αναπαραγωγής, διασταύρωσης και μετάλλαξης) και τον τερματισμό σύγχρονων, στοχαστικών ευρετικών αλγορίθμων, όπως αυτού της Γενετικής Αναζήτησης. Έτσι, η απλή και κλασική αντιμετώπιση του προβλήματος μέσω καθορισμού περιφερειών διανομής και κατόπιν εφαρμογή ευρετικών αλγορίθμων επίλυσης του προβλήματος σε κάθε περιφέρεια μετατρέπεται σε ένα ενιαίο διαδραστικό σύστημα, που εκμεταλλεύεται βέλτιστα την εμπειρία του ανθρώπου, τις τεχνικές βελτισοποίησης και την ταχύτητα και λειτουργικότητα εκτέλεσης πράξεων του υπολογιστή. Στο πρώτο κεφάλαιο (Εισαγωγή) επιχειρείται ο καθορισμός και η ανάλυση του προβλήματος διανομής, δίνοντας έμφαση στους πραγματικούς στόχους των επιχειρήσεων και τους περιορισμούς (χρονικούς, χωρικούς, θεσμικούς) του συστήματος διανομής. Μέσα από την κατανόηση των απαιτήσεων των χρηστών η εργασία οδηγείται στην επίλυση προβλημάτων με αντικειμενικές συναρτήσεις και περιορισμούς που αντανακλούν το πραγματικό φαινόμενο της διανομής προϊόντων σε σύνθετο περιβάλλον πόλης και όχι σε απλοποιητικές εκδοχές του. Στο δεύτερο κεφάλαιο παρουσιάζονται τακτικά προβλήματα δρομολόγησης και προγραμματισμού οχημάτων, η μαθηματική τους έκφραση και οι τρόποι μοντελοποίησης του προβλήματος της φυσικής διανομής. Στο τρίτο κεφάλαιο επιχειρείται η βιβλιογραφική επισκόπηση των υφισταμένων αλγορίθμων και μεθοδολογιών επίλυσης του προβλήματος. Ιδιαίτερη έμφαση δίδεται σε κάποιους σύγχρονους στοχαστικούς αλγορίθμους, όπως οι Γενετικοί Αλγόριθμοι, που ενώ έχουν τύχει ευρύτατης και επιτυχούς εφαρμογής σε άλλα γνωστικά πεδία, συναντούν ακόμη περιορισμένη μόνο εφαρμογή στη βελτιστοποίηση του σχεδιασμού δρομολογίων διανομής, λόγω της φύσεως των περιορισμών του προβλήματος.

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1458302171

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://www.theses.fr/2017ECLI0009

►

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)

▼

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 particulier un nouveau défi. Afin d’accroître la productivité et de réduire les coûts de la logistique, ce travail de recherche contribue à l’optimisation d’un problème de tournées de service à domicile multi-dépôt, multi-période avec fenêtres de temps de vie réelle. Le problème vient d’un contexte réaliste et est formulé comme un modèle en Mixed Integer Programming (MIP). Les résultats avec Cplex montrent que ce problème ne peut être résolu par des méthodes exactes dans un délai raisonnable pour une utilisation pratique. Par conséquent, nous introduisons des heuristiques. Premièrement, les heuristiques de recherche locales sont utilisées pour résoudre le problème. Les solutions réalisables initiales sont générées par une heuristique de construction et plusieurs heuristiques de recherche locales sont appliquées pour obtenir des solutions dans un temps de calcul assez court. Ensuite, nous proposons un algorithme génétique avec une nouvelle représentation du chromosome et de nouveaux opérateurs génétiques pour le problème abordé. Enfin, nous considérons un algorithme génétique avec contrôle de la diversité pour problèmes à grande échelle. Les solutions infaisables sont prises en compte dans la population et la contribution à la diversité fait partie de l’évaluation afin d’éviter une recherche prématurée. Ces méthodes ont été mises en œuvre avec succès pour optimiser le problème de routage.

The logistics performance of enterprises and the optimization of transportation have become a great issue in recent years. Field force planning and optimization is a new challenge for the service sector. In order to increase productivity and reduce cost of logistics, this research contributes to the optimization of a real-life multi-depot multi-period field service routing problem with time window. The problem is abstracted from the realistic problem and formulated as a Mixed Integer Programming (MIP) model. Computational results with Cplex show that this problem cannot be solved by exact methods in reasonable time for practical use. First, local search heuristics are used for solving the problem. Initial feasible solutions are generated by a constructive heuristic and several local search heuristics are applied to obtain solutions in a very short computing time. Then we propose a genetic algorithm with new representation of chromosome and new genetic operators for the addressed problem. Finally we consider a genetic algorithm with diversity control to deal with large scale problems. Infeasible solutions are taken account in the population and the diversity contribution is part of the evaluation to avoid premature of search. These methods have been successfully implemented to the optimization of the routing problem

Advisors/Committee Members: El Kamel, Abdelkader (thesis director).

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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

Open Access Theses and Dissertations