17,016 Hits in 6.5 sec

Solving Segment Routing Problems with Hybrid Constraint Programming Techniques [chapter]

Renaud Hartert, Pierre Schaus, Stefano Vissicchio, Olivier Bonaventure
2015 Lecture Notes in Computer Science  
In this paper, we propose a new hybrid constraint programming framework to solve traffic engineering problems in segment routing.  ...  Unfortunately, by changing the way paths are computed, segment routing poses new optimization problems which cannot be addressed with previous research contributions.  ...  Conclusion This paper presented an hybrid framework to solve segment routing problems with constraint programming and large neighborhood search.  ... 
doi:10.1007/978-3-319-23219-5_41 fatcat:6x6mtg7kcvaaxehtcpvdwi2hky

New developments in metaheuristics and their applications

Hoong Chuin Lau, Günther R. Raidl, Pascal Van Hentenryck
2016 Journal of Heuristics  
Today, MIC has a long-standing international tradition and is for many researchers and practitioners working in the field of metaheuristics one of the leading scientific events to exchange with colleagues  ...  We received 86 submissions which have been reviewed by the Program Committee, finally yielding 25 accepted full papers and 34 extended abstracts that were scheduled to be presented at the conference and  ...  In the article Mendoza et al. (2015) "A hybrid metaheuristic for the vehicle routing problem with stochastic demand and duration constraints" by Jorge E. Mendoza, Louis-Martin Rousseau, and Juan G.  ... 
doi:10.1007/s10732-016-9313-x fatcat:gjzdh7n44jgwjfaavgf5jj3ply

Standard Cell Layout Regularity and Pin Access Optimization Considering Middle-of-Line

Wei Ye, Bei Yu, David Z. O. Pan, Yong-Chan Ban, Lars Liebmann
2015 Proceedings of the 25th edition on Great Lakes Symposium on VLSI - GLSVLSI '15  
This problem is formulated as a general integer linear programming (ILP), which may suffer from long runtime for some large standard cell cases.  ...  Therefore, we also develop a set of hybrid techniques to quickly search for high-quality solutions. The experimental results demonstrate the effectiveness of our approaches.  ...  In this section we propose a fast URPAO approach with hybrid techniques.  ... 
doi:10.1145/2742060.2742084 dblp:conf/glvlsi/YeYPBL15 fatcat:sk4btcu5bve3fmjcunaq7fdjoi

Integral Approaches to Integrated Scheduling [chapter]

Ghada A. El Khayat
2007 Multiprocessor Scheduling, Theory and Applications  
Hybridization among operations research techniques and constraint programming techniques is one of the most promising avenues for this class of problems.  ...  • Problem Decomposition Decomposing the problem into separated modules, and then solving each part with a different technique.  ...  This volume contains four major parts that cover the following directions: the state of the art in theory and algorithms for classical and non-standard scheduling problems; new exact optimization algorithms  ... 
doi:10.5772/5224 fatcat:6zpczkqfsrbtpheuu2cuc3jbpa

A Constraint Programming Approach to Electric Vehicle Routing with Time Windows [chapter]

Kyle E. C. Booth, J. Christopher Beck
2019 Lecture Notes in Computer Science  
We propose the first constraint programming (CP) approaches for modeling and solving the EVRPTW and compare them to an existing mixed-integer linear program (MILP).  ...  We also present a hybrid MILP-CP approach that outperforms the other techniques for distance minimization problems over long scheduling horizons, a class that CP struggles with on its own.  ...  Conclusion and Perspective In this paper we presented the first approaches for solving the Electric Vehicle Routing Problem with Time Windows (EVRPTW) using constraint programming (CP).  ... 
doi:10.1007/978-3-030-19212-9_9 fatcat:e43umihvfvdt5opb7xb5yocm5m

A hybrid evolutionary approach for solving constrained optimization problems over finite domains

J. Ruz, F. Saenz, L. Araujo, A. Ruiz-Andino
2000 IEEE Transactions on Evolutionary Computation  
A novel approach for the integration of evolution programs and constraint-solving techniques over finite domains is presented.  ...  This integration provides a problem-independent optimization strategy for large-scale constrained optimization problems over finite domains.  ...  Thus, hybridization with stochastic techniques such as evolution programs is a promising approach.  ... 
doi:10.1109/4235.887235 fatcat:epxxfudgjnf55hq5xrvoqcxyli

A memetic algorithm for the patient transportation problem

Zhenzhen Zhang, Mengyang Liu, Andrew Lim
2015 Omega : The International Journal of Management Science  
A route is feasible only if it satisfies a series of side constraints, such as the pair and precedence constraints, capacity limit, ride time, route duration limit and time windows.  ...  We model the problem as a multi-trip dial-a-ride problem (MTDARP), which requires designing several routes for each ambulance.  ...  Guerriero et al. [18] presented the greedy randomized adaptive search programming (GRASP) to solve DARP with heterogeneous vehicles.  ... 
doi:10.1016/ fatcat:5bfc7upnvng7xnmdbqz5clju7m

Diesel engine optimisation, with emissions constraints, on a prescribed driving route

Gareth Pease, David Limebeer, Peter Fussey
2017 2017 IEEE AFRICON  
A method for evaluating driving technique and engine operation, with emissions constraints, on a real driving route, is presented.  ...  A single degree of freedom vehicle model with simple resistive forces is driven along the pre-planned route.  ...  The problem is solved with a direct collocation method to ensure that the total emissions constraints are met for the duration of the journey. II. FUEL MINIMISATION OPTIMAL CONTROL PROBLEM A.  ... 
doi:10.1109/afrcon.2017.8095517 dblp:conf/africon/PeaseLF17 fatcat:giggm7w7qjfrjfvciilh5ggmum

Model and Hybrid Algorithm of Collaborative Distribution System with Multiple Drones and a Truck

Min Lin, Jun-Yan Lyu, Jia-Jing Gao, Ling-Yu Li
2020 Scientific Programming  
This study provides a new mixed-integer programming model of the routing problem with this distribution system based on urban road network.  ...  Meanwhile, a hybrid genetic algorithm and a hybrid particle swarm algorithm are designed.  ...  Similar to the hybrid genetic algorithm, the hybrid particle swarm algorithm here also divides the routing problem into a master problem and a child problem.  ... 
doi:10.1155/2020/8887057 fatcat:ufufjhfmzndn7jew3ebtlayqmi

Mathematical Rescheduling Models For Railway Services

Zuraida Alwadood, Adibah Shuib, Norlida Abd Hamid
2013 Zenodo  
Integer programming (IP) and mixed-integer programming (MIP) models are critically discussed, focusing on the model approach, decision variables, sets and parameters.  ...  These analyses would be able to help in the development of new approaches in rescheduling strategies or perhaps to enhance the existing rescheduling models and make them more powerful or more applicable with  ...  Many existing techniques that are used to solve such a large combinatorial problem would consume a huge amount of computation time and require a large memory space to produce solution with inconsistent  ... 
doi:10.5281/zenodo.1086721 fatcat:nj2o6ekd4rayrbg5xzhtxbqd2a

Meta-Heuristic Algorithms for FPGA Segmented Channel Routing Problems with Non-standard Cost Functions

Sancho Salcedo-Sanz, Yong Xu, Xin Yao
2005 Genetic Programming and Evolvable Machines  
In this paper we present three meta-heuristic approaches for FPGA segmented channel routing problems (FSCRPs) with a new cost function in which the cost of each assignment is not known in advance, and  ...  We present two hybrid algorithms which use a Hopfield neural network to solve the problem's constraints, mixed with a Genetic Algorithm (GA) and a Simulated Annealing (SA).  ...  Banzhaf for his help with the paper.  ... 
doi:10.1007/s10710-005-3295-z fatcat:slwb5lrzrfcpzpzt5ifrgjbj7y

A Comprehensive Study of Vehicle Routing Problem With Time Windows Using Ant Colony Optimization Techniques

Avirup Guha Neogi, Singamreddy Mounika, Salagrama Kalyani, S A. Yogananda Sai
2018 International Journal of Engineering & Technology  
Among many variants of VRP, this paper presents a comprehensive survey on VRP with Time Window constraints(VRPTW).  ...  ACO is being applied to various optimization problems till date and has been giving good quality results in the field. One such popular problem is known as Vehicle Routing Problem(VRP).  ...  [43] proposed an ant-based solver to solve dynamic vehicle routing problem with time windows and multiple priorities (DVRPTWMP).  ... 
doi:10.14419/ijet.v7i2.32.13532 fatcat:4gfinfwennauxhyonzgbdchrsa

Hybrid Intelligent Algorithm for Flexible Job-Shop Scheduling Problem under Uncertainty [chapter]

Guojun Zhang, Haiping Zhu, Chaoyong Zhang
2011 Advances in Reinforcement Learning  
Then use hybrid intelligent algorithm with weights of three objectives being 1/3 respectively to solve the problem.  ...  The stochastic programming model with chance-constraint Generally, job-shop problem is depicted by a non-linear programming model.  ...  Hybrid Intelligent Algorithm for Flexible Job-Shop Scheduling Problem under Uncertainty, Advances in Reinforcement Learning, Prof.  ... 
doi:10.5772/13195 fatcat:6rfzylvckvghzdhupi4keytpz4

Towards Collaborative Optimisation in a Shared-logistics Environment for Pickup and Delivery Operations

Timothy Curtois, Wasakorn Laesanklang, Dario Landa-Silva, Mohammad Mesgarpour, Yi Qu
2017 Proceedings of the 6th International Conference on Operations Research and Enterprise Systems  
The overall aim of the project is to integrate various optimisation techniques into a framework that facilitates collaboration in a shared freight transport logistics environment with the overall goal  ...  is an R&D project that seeks to develop optimisation technology to enable more efficient collaboration in transportation, particularly real-world operational environments involving pickup and delivery problems  ...  The insertion problem can be formulated as an integer programming problem and solved using a mathematical programming solver.  ... 
doi:10.5220/0006291004770482 dblp:conf/icores/CurtoisLLMQ17 fatcat:rx4ha65afrfrtkaghpghuhwm64

Traffic flow optimization using a quantum annealer [article]

Florian Neukart, Gabriele Compostella, Christian Seidel, David von Dollen, Sheir Yarkoni, Bob Parney
2017 arXiv   pre-print
Due to the limited size and connectivity of current-generation D-Wave QPUs, we use a hybrid quantum and classical approach to solve the traffic flow problem.  ...  Quantum annealing algorithms belong to the class of meta-heuristic tools, applicable for solving binary optimization problems.  ...  Therefore, the problem was solved using the hybrid classical/quantum tool qbsolv (described in the next section).  ... 
arXiv:1708.01625v2 fatcat:5wiejjjv6rf77gpwxhyuf67wvq
« Previous Showing results 1 — 15 out of 17,016 results