@conference { ISI:000392439200065, title = {A literature review on the full truckload vehicle routing problems}, booktitle = {PROCEEDINGS OF THE 3RD IEEE INTERNATIONAL CONFERENCE ON LOGISTICS OPERATIONS MANAGEMENT (GOL{\textquoteright}16)}, year = {2016}, note = {3rd IEEE International Conference on Logistics Operations Management (GOL), Fes, MOROCCO, MAY 23-25, 2016}, publisher = {Sidi Mohammed Ben Abdellah Univ Fes, Fac Sci \& Technol; Mohammed V Univ Rabat, ENSIAS Sch; Univ Havre; IEEE}, organization = {Sidi Mohammed Ben Abdellah Univ Fes, Fac Sci \& Technol; Mohammed V Univ Rabat, ENSIAS Sch; Univ Havre; IEEE}, abstract = {This article presents a literature review of the full truckload vehicle routing problem (FTVRP). In this problem, each vehicle can serve only one order at a time; thereafter, the delivery must be completed before the next request. Our review has considered some papers published between 1983 and 2015 and their classification was based on two main areas: First, the issue discussed with encountered business constraints and the obvious applications in industry. Second, the solution methods, both exact and approached (heuristics and metaheuristics). Some lines for further works are presented as well.}, isbn = {978-1-4673-8571-8}, author = {Annouch, Anouar and Bouyahyaoui, Karim and Bellabdaoui, Adil}, editor = {Alaoui, AE and Benadada, Y and Boukachour, J} } @conference { ISI:000392439200017, title = {A new crossover to solve the full truckload vehicle routing problem using genetic algorithm}, booktitle = {PROCEEDINGS OF THE 3RD IEEE INTERNATIONAL CONFERENCE ON LOGISTICS OPERATIONS MANAGEMENT (GOL{\textquoteright}16)}, year = {2016}, note = {3rd IEEE International Conference on Logistics Operations Management (GOL), Fes, MOROCCO, MAY 23-25, 2016}, publisher = {Sidi Mohammed Ben Abdellah Univ Fes, Fac Sci \& Technol; Mohammed V Univ Rabat, ENSIAS Sch; Univ Havre; IEEE}, organization = {Sidi Mohammed Ben Abdellah Univ Fes, Fac Sci \& Technol; Mohammed V Univ Rabat, ENSIAS Sch; Univ Havre; IEEE}, abstract = {This paper considers the full-truckload selective multi-depot vehicle routing problem under time windows constraints (denoted by FT-SMDVRPTW), which is a generalization of the vehicle routing problem (VRP). Our objective function is to maximize the total profit that the vehicle generates during its trip. In this study, we{\textquoteright}ll present a review of literature about full truckload vehicle routing; we{\textquoteright}ll define the FT-SMDVRPTW that will be resolved via using genetic algorithm. A new complex two-part chromosome is used to represent the solution to our problem. Through a selection based on the elitist method and roulette method, an improved crossover operator called selected two-part chromosome crossover (STCX), and swap mutation operator new individuals are generated. Finally, we give a numerical example on a randomly generated instance to illustrate our approach.}, isbn = {978-1-4673-8571-8}, author = {El Bouyahyiouy, Karim and Bellabdaoui, Adil}, editor = {Alaoui, AE and Benadada, Y and Boukachour, J} } @conference { ISI:000391420300022, title = {Split delivery and pickup vehicle routing problem with two-dimensional loading constraints}, booktitle = {2016 11TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS: THEORIES AND APPLICATIONS (SITA)}, series = {International Conference on Intelligent Systems, Theories and Applications}, year = {2016}, note = {11th International Conference on Intelligent Systems - Theories and Applications (SITA), Mohammedia, MOROCCO, OCT 19-20, 2016}, publisher = {IEEE; Univ Hassan Casablanca; IEEE Morocco Sect; Fac Sci Tech Mohammedia}, organization = {IEEE; Univ Hassan Casablanca; IEEE Morocco Sect; Fac Sci Tech Mohammedia}, abstract = {In this paper, we address the distribution problem of liquefied petroleum gas (LPG). In particular we are targeting the optimization of pickup and split delivery of gas bottles to a set of customers with loading constraints. The problem combines the loading of a heterogeneous fleet of vehicles through set of different size racks and then the establishment of divisible deliveries (split delivery: SDVRP). The problem discussed in this paper can be presented as a Multi-depot Two-Loading Split Delivery and Pickup using Heterogeneous fleet of Vehicles with Time Windows vehicle Routing Problem and with Multi-Product (2L-SDP-HVRPTW-MP). After proposing a mathematical formulation for this problem (MILP), we tested our model firstly by a small instances using ILOG CPLEX solver following this by testing and discussing numerical results.}, isbn = {978-1-5090-5781-8}, issn = {2378-2528}, author = {Annouch, Anouar and Bellabdaoui, Adil and Minkhar, Jawad} } @conference { ISI:000380409500013, title = {Gas-filling stations procurement problem with time windows using a heterogeneous fleet of full tankers}, booktitle = {2015 10TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS: THEORIES AND APPLICATIONS (SITA)}, year = {2015}, note = {10th International Conference on Intelligent Systems - Theories and Applications (SITA), ENSIAS, Rabat, MOROCCO, OCT 20-21, 2015}, publisher = {IEEE}, organization = {IEEE}, abstract = {In this paper, we address the problem of procurement related to the supply of liquefied petroleum gas (LPG). We are interested in the issue of shipping large quantities of bulk gas (butane and propane) from storage terminals to filling stations storage capacities using a fleet of tankers. The procurement goal is the assignment of quantities of gas to be transferred for each filling station; then, the shipping of these quantities with a heterogeneous fleet of tankers which respects the time schedule of those stations. After a review of literature for the classes of vehicle routing problem with backhauls in oil and gas procurement problems, we will present an integer linear programming formulation (ILP), then, we attempt to solve the problem using a solver, following this by testing and discussing results.}, isbn = {978-1-5090-0220-7}, author = {Annouch, Anouar and Bellabdaoui, Adil} } @article {9954595520141215, title = {Solving a mixed integer linear program with times setup for the steel-continuous casting planning and scheduling problem.}, journal = {International Journal of Production Research}, volume = {52}, number = {24}, year = {2014}, pages = {7276 - 7296}, abstract = {In this paper, we present a novel model that generalise the steelmaking continuous casting planning and scheduling problem. The model includes three stages: converters namely CV, refining stands namely RS and continuous castings namely CC. The obtained problem can be formulated as a mathematical program with typical constraints, namely the times setup constraints. We develop a mixed integer linear program (MILP) to schedule several sequences of charges for more than two continuous castings devices. The aim is: (i) on one hand, to schedule a list of several sequences that are already ordered for each continuous casting with times setup between two successive sequences, (ii) on the other hand, to determine the optimal order of the successive sequences. We use a benchmark and randomly generated instances to test the model and solved by mean of the commercial software solverCplex v12.5. These problems span a variety of instances varying from small to large sized instances with different i}, keywords = {Continuous casting, Linear programming, Mathematical models, Mathematical optimization, MILP, Mixed integer linear programming, optimisation, planning, Scheduling, setup, steel}, issn = {00207543}, url = {http://search.ebscohost.com/login.aspx?direct=true\&db=bth\&AN=99545955\&site=ehost-live}, author = {Sbihi, Abdelkader and Bellabdaoui, Adil and Teghem, Jacques} } @article { ISI:000345075300010, title = {Solving a mixed integer linear program with times setup for the steel-continuous casting planning and scheduling problem}, journal = {INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH}, volume = {52}, number = {24}, year = {2014}, month = {DEC 17}, pages = {7276-7296}, abstract = {In this paper, we present a novel model that generalise the steelmaking continuous casting planning and scheduling problem. The model includes three stages: converters namely CV, refining stands namely RS and continuous castings namely CC. The obtained problem can be formulated as a mathematical program with typical constraints, namely the times setup constraints. We develop a mixed integer linear program (MILP) to schedule several sequences of charges for more than two continuous castings devices. The aim is: (i) on one hand, to schedule a list of several sequences that are already ordered for each continuous casting with times setup between two successive sequences, (ii) on the other hand, to determine the optimal order of the successive sequences. We use a benchmark and randomly generated instances to test the model and solved by mean of the commercial software solver Cplex v12.5. These problems span a variety of instances varying from small to large sized instances with different intrinsec parameters as the availability date for a converter CV or the variation intervals of the start time for the first charge at the continuous casting CC stage. We analyse the efficiency of the proposed model based on the CPU time and show the time limitations of the model for large instances. Also, we show the robustness of the model when modifying the initial (starting) state.}, issn = {0020-7543}, doi = {10.1080/00207543.2014.919421}, author = {Sbihi, Abdelkader and Bellabdaoui, Adil and Teghem, Jacques} } @article { ISI:000345075300025, title = {Solving a Mixed Integer Linear Program with Times Setup for the Steel-Continuous Casting Planning and Scheduling Problem (vol 52, pg 7276, 2014)}, journal = {INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH}, volume = {52}, number = {24}, year = {2014}, month = {DEC 17}, pages = {7549}, issn = {0020-7543}, doi = {10.1080/00207543.2014.969490}, author = {Sbihi, Abdelkader and Bellabdaoui, Adil and Teghem, Jacques} }