Log in

Relevant bibliographies by topics / Vehicle routing problem with loading constraints / Journal articles

To see the other types of publications on this topic, follow the link: Vehicle routing problem with loading constraints.

Journal articles on the topic 'Vehicle routing problem with loading constraints'

Author: Grafiati

Published: 10 January 2023

Last updated: 28 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Vehicle routing problem with loading constraints.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Ostermeier, Manuel, Sara Martins, Pedro Amorim, and Alexander Hübner. "Loading constraints for a multi-compartment vehicle routing problem." OR Spectrum 40, no. 4 (June 29, 2018): 997–1027. http://dx.doi.org/10.1007/s00291-018-0524-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Yi, Junmin, Zhixiong Su, and Yihui Qiu. "The vehicle routing problem with one-dimensional loading constraints." International Journal of Industrial and Systems Engineering 27, no. 3 (2017): 412. http://dx.doi.org/10.1504/ijise.2017.087193.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Qiu, Yihui, Junmin Yi, and Zhixiong Su. "The vehicle routing problem with one-dimensional loading constraints." International Journal of Industrial and Systems Engineering 27, no. 3 (2017): 412. http://dx.doi.org/10.1504/ijise.2017.10007560.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Doerner, Karl F., Guenther Fuellerer, Richard F. Hartl, Manfred Gronalt, and Manuel Iori. "Metaheuristics for the vehicle routing problem with loading constraints." Networks 49, no. 4 (2007): 294–307. http://dx.doi.org/10.1002/net.20179.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Chen, Zongyi, Mingkang Yang, Yijun Guo, Yu Liang, Yifan Ding, and Li Wang. "The Split Delivery Vehicle Routing Problem with Three-Dimensional Loading and Time Windows Constraints." Sustainability 12, no. 17 (August 27, 2020): 6987. http://dx.doi.org/10.3390/su12176987.

Full text

Abstract:

Besides routing and packing plans, synthetically considering the requirements of customers about service time is absolutely necessary. An order split delivery plan can not only better satisfy the service time requirements, but also improve the full-load rate of vehicles. The split delivery vehicle routing problem with three-dimensional loading constraints (3L-SDVRP) combines vehicle routing and three-dimensional loading with additional packing constraints. In the 3L-SDVRP splitting deliveries of customers is basically possible, i.e., a customer can be visited in two or more tours. The vehicle routing problem with three-dimensional loading constraints that are based on the time window and considering split delivery of orders (3L-CVRPTWSDO) and its optimization algorithm are studied in this paper. We established mathematical model of the problem and designed the tabu search algorithm. Based on the examples used in Gendreau et al. (2006), examples was constructed to test our algorithm. The experimental results have expressed that, in the 3L-CVRP problem, the results of split delivery is better than those of non-split delivery, and it is easier to satisfy the time window constraints. The algorithm in this paper generates high quality solutions, it provides a effective method to solve the 3L-CVRPTWSDO problems.

APA, Harvard, Vancouver, ISO, and other styles

6

Candido, Lilian Caroline Xavier, and Luzia Vidal de Souza. "Mathematical Model and Simulated Annealing Algorithm for the Two-Dimensional Loading Heterogeneous Fixed Fleet Vehicle Routing Problem." Mathematical Problems in Engineering 2022 (January 28, 2022): 1–19. http://dx.doi.org/10.1155/2022/6012105.

Full text

Abstract:

This paper addresses the two-dimensional loading heterogeneous fixed fleet vehicle routing problem, which is a complex and unstudied variant of the classical vehicle routing problem and has a wide range of applications in transportation and logistics fields. In this problem, each customer demands a set of rectangular two-dimensional items, and the objective is to find the minimum cost delivery routes for a limited set of vehicles with different capacities, fixed and variable operating costs, and rectangular two-dimensional loading surfaces. We formulate a mixed integer linear programming model to obtain optimal solutions for small-scale problems. To obtain solutions for large-scale problems, we develop an algorithm based on simulated annealing and local search, which uses a collection of packing heuristics to address the loading constraints, and we also propose three new heuristics. We conduct experiments on benchmark instances derived from the two-dimensional loading heterogeneous fleet vehicle routing problem. The results indicate that the proposed model correctly describes the problem and can solve small-scale problems, that the new packing heuristics are effective in improving the collection of packing heuristics, and that the proposed simulated annealing algorithm can find good solutions to large-scale problems within an acceptable computational time. Hence, it can be used by logistic companies using a heterogeneous fixed fleet in the integrated planning of vehicle loading and routing.

APA, Harvard, Vancouver, ISO, and other styles

7

Meliani, Youssef, Yasmina Hani, Sâad Lissane Elhaq, and Abderrahman El Mhamedi. "Vehicle routing problem with three-dimensional loading constraints: Experimentations and evaluation." IFAC-PapersOnLine 54, no. 1 (2021): 104–9. http://dx.doi.org/10.1016/j.ifacol.2021.08.076.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Bortfeldt, Andreas, and Junmin Yi. "The Split Delivery Vehicle Routing Problem with three-dimensional loading constraints." European Journal of Operational Research 282, no. 2 (April 2020): 545–58. http://dx.doi.org/10.1016/j.ejor.2019.09.024.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Zhang, Qun, Li Rong Wei, Rui Hu, Rui Yan, Li Hua Li, and Xiao Ning Zhu. "A Review on the Bin Packing Capacitated Vehicle Routing Problem." Advanced Materials Research 853 (December 2013): 668–73. http://dx.doi.org/10.4028/www.scientific.net/amr.853.668.

Full text

Abstract:

This paper introduced the Bin Packing Capacitated Vehicle Routing Problem. It introduced the constraints and differences between algorithms of two-dimensional and three-dimensional loading capacitated vehicle routing problem. It gave a review of models and algorithms for Bin Packing Capacitated VRP. Finally, it prospected future research orientations and possible improvement in this area.

APA, Harvard, Vancouver, ISO, and other styles

10

Dabia, Said, Stefan Ropke, and Tom van Woensel. "Cover Inequalities for a Vehicle Routing Problem with Time Windows and Shifts." Transportation Science 53, no. 5 (September 2019): 1354–71. http://dx.doi.org/10.1287/trsc.2018.0885.

Full text

Abstract:

This paper introduces the vehicle routing problem with time windows and shifts (VRPTWS). At the depot, several shifts with nonoverlapping operating periods are available to load the planned trucks. Each shift has a limited loading capacity. We solve the VRPTWS exactly by a branch-and-cut-and-price algorithm. The master problem is a set partitioning with an additional constraint for every shift. Each constraint requires the total quantity loaded in a shift to be less than its loading capacity. For every shift, a pricing subproblem is solved by a label-setting algorithm. Shift capacity constraints define knapsack inequalities; hence we use valid inequalities inspired from knapsack inequalities to strengthen the linear programming relaxation of the master problem when solved by column generation. In particular, we use a family of tailored robust cover inequalities and a family of new nonrobust cover inequalities. Numerical results show that nonrobust cover inequalities significantly improve the algorithm.

APA, Harvard, Vancouver, ISO, and other styles

11

Rodríguez, Diego Alejandro Acosta, David Álvarez Martínez, and John Willmer Escobar. "A hybrid matheuristic approach for the vehicle routing problem with three-dimensional loading constraints." International Journal of Industrial Engineering Computations 13, no. 3 (2022): 421–34. http://dx.doi.org/10.5267/j.ijiec.2022.1.002.

Full text

Abstract:

This paper proposes a matheuristic algorithm based on a column generation structure for the capacitated vehicle routing problem with three-dimensional loading constraints (3L–CVRP). In the column generation approach, the master problem is responsible for managing the selection of best-set routes. In contrast, the slave problem is responsible for solving a shorter restricted route problem (CSP, Constrained Shortest Path) for generating columns (feasible routes). The CSP is not necessarily solved to optimality. In addition, a greedy randomized adaptive search procedure (GRASP) algorithm is used to verify the packing constraints. The master problem begins with a set of feasible routes obtained through a multi-start randomized constructive algorithm (MSRCA) heuristic for the multi-container loading problem (3D–BPP, three-dimensional bin packing problem). The MSRCA consists of finding valid routes considering the customers' best packing (packing first-route second). The efficiency of the proposed approach has been validated by a set of benchmark instances from the literature. The results show the efficiency of the proposed approach and conclude that the slave problem is too complex and computationally expensive to solve through a MIP.

APA, Harvard, Vancouver, ISO, and other styles

12

Yu, Nai K., Wen Jiang, Rong Hu, Bin Qian, and Ling Wang. "Learning Whale Optimization Algorithm for Open Vehicle Routing Problem with Loading Constraints." Discrete Dynamics in Nature and Society 2021 (December 26, 2021): 1–14. http://dx.doi.org/10.1155/2021/8016356.

Full text

Abstract:

This paper addresses the two-dimensional loading open vehicle routing problem with time window (2L-OVRPTW). We propose a learning whale optimization algorithm (LWOA) to minimize the total distance; an improved skyline filling algorithm (ISFA) is designed to solve the two-dimensional loading problem. In LWOA, the whale optimization algorithm is used to search the solution space and get the high-quality solution. Then, by learning and accumulating the block structure and customer location information in the high-quality solution individuals, a three-dimensional matrix is designed to guide the updating of the population. Finally, according to the problem characteristics, the local search method based on fleet and vehicle is designed and performed on the high-quality solution region. IFSA is used to optimize the optimal individual. The computational results show that the proposed algorithm can effectively solve 2L-OVRPTW.

APA, Harvard, Vancouver, ISO, and other styles

13

Leung, Stephen C. H., Jiemin Zheng, Defu Zhang, and Xiyue Zhou. "Simulated annealing for the vehicle routing problem with two-dimensional loading constraints." Flexible Services and Manufacturing Journal 22, no. 1-2 (June 2010): 61–82. http://dx.doi.org/10.1007/s10696-010-9061-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Zhou, Kang, Shiwei He, and Rui Song. "Optimization for Service Routes of Pallet Service Center Based on the Pallet Pool Mode." Computational Intelligence and Neuroscience 2016 (2016): 1–11. http://dx.doi.org/10.1155/2016/5691735.

Full text

Abstract:

Service routes optimization (SRO) of pallet service center should meet customers’ demand firstly and then, through the reasonable method of lines organization, realize the shortest path of vehicle driving. The routes optimization of pallet service center is similar to the distribution problems of vehicle routing problem (VRP) and Chinese postman problem (CPP), but it has its own characteristics. Based on the relevant research results, the conditions of determining the number of vehicles, the one way of the route, the constraints of loading, and time windows are fully considered, and a chance constrained programming model with stochastic constraints is constructed taking the shortest path of all vehicles for a delivering (recycling) operation as an objective. For the characteristics of the model, a hybrid intelligent algorithm including stochastic simulation, neural network, and immune clonal algorithm is designed to solve the model. Finally, the validity and rationality of the optimization model and algorithm are verified by the case.

APA, Harvard, Vancouver, ISO, and other styles

15

Sun, Lulu, Wei Jia, Qi Jiang, Weixuan Shi, and Meng Zhang. "Research on Bi-objective Vehicle Routing Problem Considering Empty Loading Ratio." Journal of Physics: Conference Series 2025, no. 1 (September 1, 2021): 012020. http://dx.doi.org/10.1088/1742-6596/2025/1/012020.

Full text

Abstract:

Abstract The vehicle routing plan in logistic distribution minimizing the transportation cost merely may lead to high empty loading ratio and a waste of logistic resources. This research studies the bi-objective vehicle routing problem considering empty loading ratio. The definitions about the empty loading ratio are proposed firstly. A bi-objective vehicle routing model is developed, minimizing the empty loading ratio and transportation cost simultaneously. Then, the solution method based on ɛ constraint method is provided to compute the Pareto optimal solutions. Finally, numerical experiments are reported, and the results show that the ɛ constraint method is better than the weighting method for the proposed problem.

APA, Harvard, Vancouver, ISO, and other styles

16

Fuellerer, Guenther, Karl F. Doerner, Richard F. Hartl, and Manuel Iori. "Metaheuristics for vehicle routing problems with three-dimensional loading constraints." European Journal of Operational Research 201, no. 3 (March 2010): 751–59. http://dx.doi.org/10.1016/j.ejor.2009.03.046.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Sbai, Ines, and Saoussen Krichen. "A Novel Adaptive Genetic Algorithm for Dynamic Vehicle Routing Problem With Backhaul and Two-Dimensional Loading Constraints." International Journal of Applied Metaheuristic Computing 13, no. 1 (January 2022): 1–34. http://dx.doi.org/10.4018/ijamc.2022010103.

Full text

Abstract:

In this paper, we consider an extension of the Dynamic Vehicle Routing Problem with Backhauls integrated with two-dimensional loading problem called DVRPB with 2D loading constraints (2L-DVRPB). In the VRPB, a vehicle can deliver (Linehaul) then collect goods from customers (backhaul) and bring back to the depot. Once customer demand is formed by a set of two-dimensional items the problem will be treat as a 2L-VRPB. The 2L-VRPB has been studied on the static case. However, in most real-life application, new customer requests can be happen over time of backhaul and thus perturb the optimal routing schedule that was originally invented. This problem has not been analysed sofar in the literature. The 2L-DVRPB is an NP-Hard problem, so, we propose to use a Genetic algorithm for routing and a packing problems. We applied our approach in a real case study of the Regional Post Office of the city of Jendouba in the North of Tunisia. Results indicate that the AGA approach is considered as the best approach in terms of solutions quality for a real world routing system.

APA, Harvard, Vancouver, ISO, and other styles

18

Iori, Manuel, Juan-José Salazar-González, and Daniele Vigo. "An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints." Transportation Science 41, no. 2 (May 2007): 253–64. http://dx.doi.org/10.1287/trsc.1060.0165.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Hokama, Pedro, Flávio K. Miyazawa, and Eduardo C. Xavier. "A branch-and-cut approach for the vehicle routing problem with loading constraints." Expert Systems with Applications 47 (April 2016): 1–13. http://dx.doi.org/10.1016/j.eswa.2015.10.013.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Pollaris, Hanne, Kris Braekers, An Caris, Gerrit K. Janssens, and Sabine Limbourg. "Capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints." EURO Journal on Transportation and Logistics 5, no. 2 (October 29, 2014): 231–55. http://dx.doi.org/10.1007/s13676-014-0064-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Vega‐Mejía, Carlos A., Jairo R. Montoya‐Torres, and Sardar M. N. Islam. "A nonlinear optimization model for the balanced vehicle routing problem with loading constraints." International Transactions in Operational Research 26, no. 3 (June 26, 2018): 794–835. http://dx.doi.org/10.1111/itor.12570.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Ruan, Qingfang, Zhengqian Zhang, Lixin Miao, and Haitao Shen. "A hybrid approach for the vehicle routing problem with three-dimensional loading constraints." Computers & Operations Research 40, no. 6 (June 2013): 1579–89. http://dx.doi.org/10.1016/j.cor.2011.11.013.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Ayough, Ashkan, Behrooz Khorshidvand, Negah Massomnedjad, and Alireza Motameni. "An integrated approach for three-dimensional capacitated vehicle routing problem considering time windows." Journal of Modelling in Management 15, no. 3 (February 10, 2020): 995–1015. http://dx.doi.org/10.1108/jm2-11-2018-0183.

Full text

Abstract:

Purpose As a critical problem in sophisticated distribution systems, vehicle routing plays a pivotal role in dealing with time windows and capacities constraints. The purpose of this paper is to addresses a new integrated model to incorporate both three-dimensional and time windows aspects of the routing problem. First, capacitated vehicle routing decisions are made subject to a soft time interval to meet the customers’ demands. Afterward, these decisions are entered into the three-dimensional loading problem. Design/methodology/approach The problem is solved using generalized algebraic modeling system software in small-size problems. The problem is NP-hard and requires an efficient solution methodology. For this purpose, a hybrid algorithm has been proposed to solve the large-size problems. The efficiency of this algorithm is checked by making comparisons with exact solutions for small and medium size test problems, and with the related literature for large size problems. Findings The numerical experiments show that the proposed model covers more effectively the broader aspects of the transportation problem. Furthermore, the proposed algorithm supports competitive and satisfactory results by giving reasonable outputs in comparison with previous studies. Originality/value The main purpose of this integration is to achieve minimum total transportation costs, which cannot be guaranteed without applying two referred constraints, simultaneously.

APA, Harvard, Vancouver, ISO, and other styles

24

Pollaris, Hanne, Gerrit Karel Janssens, Kris Braekers, and An Caris. "Parameter tuning of a local search heuristic for a vehicle routing problem with loading constraints." Information Technology and Management Science 23 (December 15, 2020): 55–63. http://dx.doi.org/10.7250/itms-2020-0008.

Full text

Abstract:

A vehicle routing problem (VRP) with sequence-based pallet loading and axle weight constraints is introduced in the study. An Iterated Local Search (ILS) metaheuristic algorithm is used to solve the problem. Like any metaheuristic, a number of parameters need to be set before running the experiments. Parameter tuning is important because the value of the parameters may have a substantial impact on the efficacy of a heuristic algorithm. While traditionally, parameter values have been set manually using expertise and experimentation, recently several automated tuning methods have been proposed. The performance of the routing algorithm is mostly improved by using parameter tuning, but no single best tuning method for routing algorithms exists. The tuning method, Iterated F-race, is chosen because it seems to be a very robust method and it has been shown to perform well on the ILS metaheuristic and other metaheuristics. The research aims at developing an algorithm, which performs well over a wide range of network sizes.

APA, Harvard, Vancouver, ISO, and other styles

25

Miao, Lixin, Qingfang Ruan, Kevin Woghiren, and Qi Ruo. "A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints." RAIRO - Operations Research 46, no. 1 (January 2012): 63–82. http://dx.doi.org/10.1051/ro/2012008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Zachariadis, Emmanouil E., Christos D. Tarantilis, and Christos T. Kiranoudis. "A Guided Tabu Search for the Vehicle Routing Problem with two-dimensional loading constraints." European Journal of Operational Research 195, no. 3 (June 2009): 729–43. http://dx.doi.org/10.1016/j.ejor.2007.05.058.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Bortfeldt, Andreas, Thomas Hahn, Dirk Männel, and Lars Mönch. "Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints." European Journal of Operational Research 243, no. 1 (May 2015): 82–96. http://dx.doi.org/10.1016/j.ejor.2014.12.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Junqueira, Leonardo, José F. Oliveira, Maria Antónia Carravilla, and Reinaldo Morabito. "An optimization model for the vehicle routing problem with practical three-dimensional loading constraints." International Transactions in Operational Research 20, no. 5 (October 17, 2012): 645–66. http://dx.doi.org/10.1111/j.1475-3995.2012.00872.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Lacomme, Philippe, Hélène Toussaint, and Christophe Duhamel. "A GRASP×ELS for the vehicle routing problem with basic three-dimensional loading constraints." Engineering Applications of Artificial Intelligence 26, no. 8 (September 2013): 1795–810. http://dx.doi.org/10.1016/j.engappai.2013.03.012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Bortfeldt, Andreas. "A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints." Computers & Operations Research 39, no. 9 (September 2012): 2248–57. http://dx.doi.org/10.1016/j.cor.2011.11.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Gendreau, Michel, Manuel Iori, Gilbert Laporte, and Silvaro Martello. "A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints." Networks 51, no. 1 (2007): 4–18. http://dx.doi.org/10.1002/net.20192.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Zhang, Zheng, Bin Ji, and Samson S. Yu. "An Adaptive Tabu Search Algorithm for Solving the Two-Dimensional Loading Constrained Vehicle Routing Problem with Stochastic Customers." Sustainability 15, no. 2 (January 16, 2023): 1741. http://dx.doi.org/10.3390/su15021741.

Full text

Abstract:

In practical logistic distributions, uncertainties may exist in each distribution process, and sometimes suppliers have to take undesirable measures to deal with the subsequent schedule variances. In light of the uncertainty of customers in logistics distribution and the widely applied two-dimensional loading patterns in transportation, we propose and formulate a two-dimensional loading-constrained vehicle routing problem with stochastic customers (2L-VRPSC), where each customer has a known probability of presence and customers’ demands are a set of non-stackable items. A stochastic modeling platform of 2L-VRPSC is established based on a Monte Carlo simulation and scenario analysis to minimize the expected total transportation cost. To achieve this, an enhanced adaptive tabu search (EATS) algorithm incorporating the multi-order bottom-fill-skyline (MOBFS) packing heuristic is proposed, where the EATS algorithm searches for the optimal routing combination and the MOBFS checks the feasibility of each route and guides the EATS to search for feasible solutions. The widely used two-dimensional loading-constrained vehicle routing problem (2L-VRP) benchmarks under different loading configurations considering items’ sequential and rotation constraints are applied for experiments, which demonstrates the comparable efficiency of the proposed EATS-MOBFS for solving 2L-VRP. Furthermore, the results and analysis of experiments based on the new 2L-VRPSC instances verify the versatility of the proposed solving approach, which is capable of providing more practical solutions to some real-life scenarios with customers’ uncertain information.

APA, Harvard, Vancouver, ISO, and other styles

33

Fava, Leandro, João Furtado, Gilson Helfer, Jorge Barbosa, Marko Beko, Sérgio Correia, and Valderi Leithardt. "A Multi-Start Algorithm for Solving the Capacitated Vehicle Routing Problem with Two-Dimensional Loading Constraints." Symmetry 13, no. 9 (September 14, 2021): 1697. http://dx.doi.org/10.3390/sym13091697.

Full text

Abstract:

This work presents a multistart algorithm for solving the capacitated vehicle routing problem with 2D loading constraints (2L-CVRP) allowing for the rotation of goods. Research dedicated to graph theory and symmetry considered the vehicle routing problem as a classical application. This problem has complex aspects that stimulate the use of advanced algorithms and symmetry in graphs. The use of graph modeling of the 2L-CVRP problem by undirected graph allowed the high performance of the algorithm. The developed algorithm is based on metaheuristics, such as the Constructive Genetic Algorithm (CGA) to construct promising initial solutions; a Tabu Search (TS) to improve the initial solutions on the routing problem, and a Large Neighborhood Search (LNS) for the loading subproblem. Although each one of these algorithms allowed to solve parts of the 2L-CVRP, the combination of these three algorithms to solve this problem was unprecedented in the scientific literature. In our approach, a parallel mechanism for checking the loading feasibility of routes was implemented using multithreading programming to improve the performance. Additionally, memory structures such as hash-tables were implemented to save time by storing and querying previously evaluated results for the loading feasibility of routes. For benchmarks, tests were done on well-known instances available in the literature. The results proved that the framework matched or outperformed most of the previous approaches. As the main contribution, this work brings higher quality solutions for large-size instances of the pure CVRP. This paper involves themes related to the symmetry journal, mainly complex algorithms, graphs, search strategies, complexity, graph modeling, and genetic algorithms. In addition, the paper especially focuses on topic-related aspects of special interest to the community involved in symmetry studies, such as graph algorithms and graph theory.

APA, Harvard, Vancouver, ISO, and other styles

34

Pollaris, Hanne. "Loading constraints in vehicle routing problems: a focus on axle weight limits." 4OR 16, no. 1 (September 18, 2017): 105–6. http://dx.doi.org/10.1007/s10288-017-0352-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Iori, Manuel, and Silvano Martello. "An annotated bibliography of combined routing and loading problems." Yugoslav Journal of Operations Research 23, no. 3 (2013): 311–26. http://dx.doi.org/10.2298/yjor130315032i.

Full text

Abstract:

Transportation problems involving routing and loading at the same time are currently a hot topic in combinatorial optimization. The interest of researchers and practitioners is motivated by the intrinsic difficulty of this research area, which combines two computationally hard problems, and by its practical relevance in important real world applications. This annotated bibliography aims at collecting, in a systematic way, the most relevant results obtained in the area of vehicle routing with loading constraints, with the objective of stimulating further research in this promising area.

APA, Harvard, Vancouver, ISO, and other styles

36

Wei, Lijun, Zhenzhen Zhang, Defu Zhang, and Andrew Lim. "A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints." European Journal of Operational Research 243, no. 3 (June 2015): 798–814. http://dx.doi.org/10.1016/j.ejor.2014.12.048.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Zachariadis, Emmanouil E., Christos D. Tarantilis, and Chris T. Kiranoudis. "The Vehicle Routing Problem with Simultaneous Pick-ups and Deliveries and Two-Dimensional Loading Constraints." European Journal of Operational Research 251, no. 2 (June 2016): 369–86. http://dx.doi.org/10.1016/j.ejor.2015.11.018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Wei, Lijun, Zhenzhen Zhang, Defu Zhang, and Stephen C. H. Leung. "A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints." European Journal of Operational Research 265, no. 3 (March 2018): 843–59. http://dx.doi.org/10.1016/j.ejor.2017.08.035.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Gendreau, Michel, Manuel Iori, Gilbert Laporte, and Silvano Martello. "Erratum: A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints." Networks 51, no. 2 (2008): 153. http://dx.doi.org/10.1002/net.20245.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Pollaris, Hanne, Kris Braekers, An Caris, Gerrit K. Janssens, and Sabine Limbourg. "Vehicle routing problems with loading constraints: state-of-the-art and future directions." OR Spectrum 37, no. 2 (December 18, 2014): 297–330. http://dx.doi.org/10.1007/s00291-014-0386-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Reil, Sebastian, Andreas Bortfeldt, and Lars Mönch. "Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints." European Journal of Operational Research 266, no. 3 (May 2018): 877–94. http://dx.doi.org/10.1016/j.ejor.2017.10.029.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Mahvash, Batoul, Anjali Awasthi, and Satyaveer Chauhan. "A column generation based heuristic for the capacitated vehicle routing problem with three-dimensional loading constraints." International Journal of Production Research 55, no. 6 (September 23, 2016): 1730–47. http://dx.doi.org/10.1080/00207543.2016.1231940.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Koch, Henriette, Maximilian Schlögell, and Andreas Bortfeldt. "A hybrid algorithm for the vehicle routing problem with three-dimensional loading constraints and mixed backhauls." Journal of Scheduling 23, no. 1 (October 4, 2019): 71–93. http://dx.doi.org/10.1007/s10951-019-00625-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Mahvash, Batoul, Anjali Awasthi, and Satyaveer Chauhan. "A Column Generation Based Heuristic for the Capacitated Vehicle Routing Problem with Three-dimensional Loading Constraints." IFAC-PapersOnLine 48, no. 3 (2015): 448–53. http://dx.doi.org/10.1016/j.ifacol.2015.06.122.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Krichen, Saoussen, Ines Sbai, and Olfa Limam. "Solving the capacitated vehicle routing problem with two-dimensional loading constraints using a parallel VNS approach." International Journal of Metaheuristics 8, no. 1 (2022): 51. http://dx.doi.org/10.1504/ijmheur.2022.10052727.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Sbai, Ines, Saoussen Krichen, and Olfa Limam. "Solving the capacitated vehicle routing problem with two-dimensional loading constraints using a parallel VNS approach." International Journal of Metaheuristics 8, no. 1 (2022): 51. http://dx.doi.org/10.1504/ijmheur.2022.127802.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Juárez Pérez, Marco Antonio, Rodolfo Eleazar Pérez Loaiza, Perfecto Malaquias Quintero Flores, Oscar Atriano Ponce, and Carolina Flores Peralta. "A Heuristic Algorithm for the Routing and Scheduling Problem with Time Windows: A Case Study of the Automotive Industry in Mexico." Algorithms 12, no. 5 (May 25, 2019): 111. http://dx.doi.org/10.3390/a12050111.

Full text

Abstract:

This paper investigates a real-world distribution problem arising in the vehicle production industry, particularly in a logistics company, in which cars and vans must be loaded on auto-carriers and then delivered to dealerships. A solution to the problem involves the loading and optimal routing, without violating the capacity and time window constraints for each auto-carrier. A two-phase heuristic algorithm was implemented to solve the problem. In the first phase the heuristic builds a route with an optimal insertion procedure, and in the second phase the determination of a feasible loading. The experimental results show that the purposed algorithm can be used to tackle the transportation problem in terms of minimizing total traveling distance, loading/unloading operations and transportation costs, facilitating a decision-making process for the logistics company.

APA, Harvard, Vancouver, ISO, and other styles

48

Sabar, Nasser R., Ashish Bhaskar, Edward Chung, Ayad Turky, and Andy Song. "An Adaptive Memetic Approach for Heterogeneous Vehicle Routing Problems with two-dimensional loading constraints." Swarm and Evolutionary Computation 58 (November 2020): 100730. http://dx.doi.org/10.1016/j.swevo.2020.100730.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Felipe, Angel, M. Teresa Ortuño, and Gregorio Tirado. "Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints." European Journal of Operational Research 211, no. 1 (May 2011): 66–75. http://dx.doi.org/10.1016/j.ejor.2010.11.011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Ferreira, Kamyla Maria, Thiago Alves de Queiroz, and Franklina Maria Bragion Toledo. "An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery." Computers & Operations Research 136 (December 2021): 105452. http://dx.doi.org/10.1016/j.cor.2021.105452.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!