Filters








4,888 Hits in 7.8 sec

Comparing constraint programming and mathematical programming approaches to discrete optimisation—the change problem

S Heipcke
1999 Journal of the Operational Research Society  
to the search tree), they are solved with an incomplete symbolic algorithm based on some concept of local consistency.  ...  Mathematical programming MP tools —in general MIP solver are based on some version of the simplex algorithm combined with a branch-and-bound algorithm for discrete problems.  ... 
doi:10.1057/palgrave.jors.2600730 fatcat:fknukwzkovhejeffmbetbkxxby

MULTI-OBJECTIVE STOCHASTIC SIMULATION-BASED OPTIMISATION APPLIED TO SUPPLY CHAIN PLANNING

Liana Napalkova, Galina Merkuryeva
2012 Technological and Economic Development of Economy  
The two-phase optimisation method is developed based on hybrid combination of compromise programming, evolutionary computation and response surface-based methods.  ...  Three scenarios are implemented to optimise supply chain tactical planning processes at the chemical manufacturing company based on using different optimisation methods and software.  ...  In the method, multi-objective simulation-based genetic and response surface-based linear search algorithms were sequentially used to perform the global and the local search while optimising discrete and  ... 
doi:10.3846/20294913.2012.661190 fatcat:k3lp5ikzd5a5zc2xhbqvs24zpu

Solution of goal programming models using a basic taboo search algorithm

A Baykasoglu, S Owen, N Gindy
1999 Journal of the Operational Research Society  
near-global optimum solution because these methods are local optimisation methods.  ...  In this paper a Taboo search based method is developed to solve preemptive goal programming problems.  ... 
doi:10.1057/palgrave.jors.2600788 fatcat:zqrajgtclzgs3fptmtookdjdzi

Multi-Vehicle Trajectory Optimisation On Road Networks [article]

Philip Gun, Andrew Hill, Robin Vujanic
2018 arXiv   pre-print
A globally optimal, minimum time trajectory is found for all vehicles using Mixed Integer Linear Programming (MILP).  ...  Simulation results in an open-pit mining scenario compare the proposed method against a fast heuristic method and a reactive approach based on site practices.  ...  Other future work includes optimising goal times based on machinery status and queues, and incorporating energy in optimisations. Fig. 1 : 1 Graph of a mine road network.  ... 
arXiv:1810.02517v1 fatcat:5kmozjtkmbaivib42hhl226nc4

A novel hybrid fuzzy logic-genetic algorithm-data envelopment approach for simulation optimisation of pressure vessel design problems

A. Azadeh, M. Abdollahian, M. Hamedi, S.M. Asadzadeh
2012 International Journal of Mathematics in Operational Research (IJMOR)  
The fuzzy non-linear program that we obtain is solved using a Genetic Algorithm (GA), and a simulation was used for generating the initial population.  ...  The efficiency of some of the design optimisation algorithms are compared with the proposed approach of this study, based on the Data Envelopment Analysis (DEA).  ...  Acknowledgements The authors are grateful for the valuable comments and suggestions from the respected reviewers, which have enhanced the strength and significance of our paper.  ... 
doi:10.1504/ijmor.2012.049940 fatcat:pbrjtxozfrgw7gsvwi4dd7isva

Editorial for the special issue of Information Sciences Journal (ISJ) on "Nature-inspired algorithms for large scale global optimization"

Xiaodong Li, Ke Tang, P.N. Suganthan, Zhenyu Yang
2015 Information Sciences  
These meta-heuristic algorithms do not rely on gradient information, and are less likely to be stuck on local optima because of their use of a population of candidate solutions, thereby offering significant  ...  The L-BFGS-B method is used here as an efficient local search method.  ...  We are also very thankful to the editorial staff (in particular Jacqueline Zhu and G. Shanmuga Sundaram Janani) for their dedicated support throughout the review process.  ... 
doi:10.1016/j.ins.2015.05.001 fatcat:4hamfj5akra4bi7ppzhqx3x4nu

Analytics and Machine Learning in Vehicle Routing Research [article]

Ruibin Bai and Xinan Chen and Zhi-Long Chen and Tianxiang Cui and Shuhui Gong and Wentao He and Xiaoping Jiang and Huan Jin and Jiahuan Jin and Graham Kendall and Jiawei Li and Zheng Lu and Jianfeng Ren and Paul Weng and Ning Xue and Huayan Zhang
2021 arXiv   pre-print
The Vehicle Routing Problem (VRP) is one of the most intensively studied combinatorial optimisation problems for which numerous models and algorithms have been proposed.  ...  Specifically, we review the emerging research streams on ML-assisted VRP modelling and ML-assisted VRP optimisation.  ...  Ningbo Science and Technology Bureau (grant numbers 2019B10026, 2017D10034).  ... 
arXiv:2102.10012v1 fatcat:ihs27x2qu5c55fljxuy4fhawgq

State-Of-The-Art Review of Mathematical Optimisation Approaches for Synthesis of Energy Systems

Viknesh Andiappan
2017 Process Integration and Optimization for Sustainability  
Subsequently, the synthesis of energy systems is further discussed on specific areas such as reliability, operability, flexibility and retrofit and eco-industrial parks.  ...  The main objective of this review is to provide a state-of-the-art overview of the mathematical optimisation approaches developed, particularly those developed for synthesis of energy systems, including  ...  Acknowledgements The author would like to thank the Energy and Environment Research Group at Taylor's University, for their support.  ... 
doi:10.1007/s41660-017-0013-2 fatcat:fai3bov5r5fuxpmufo6xawnfle

A self-adaptive multiagent evolutionary algorithm for electrical machine design

Jean-Laurent Hippolyte, Christelle Bloch, Pascal Chatonnay, Christophe Espanet, Didier Chamagne
2007 Proceedings of the 9th annual conference on Genetic and evolutionary computation - GECCO '07  
Each evolutionary individual is implemented as a simple agent capable of reproduction and predation. The transitions between these two states depend on the agent's local environment.  ...  Two sets of experimental results are provided: a comparison with Saw-Tooth Algorithm [5] and μGA [3] using four classical functions and an optimisation of the efficiency and the weight of an electrical  ...  Self-learning is a local search based on a small scale MAGA performed on the best agent at each generation.  ... 
doi:10.1145/1276958.1277198 dblp:conf/gecco/HippolyteBCEC07 fatcat:dotsoeaynreodk3ocbu2tryenq

Propositional Satisfiability and Constraint Programming

Lucas Bordeaux, Youssef Hamadi, Lintao Zhang
2006 ACM Computing Surveys  
Propositional Satisfiability (SAT) and Constraint Programming (CP) have developed as two relatively independent threads of research, cross-fertilising occasionally.  ...  This survey overviews the two areas in a comparative way, emphasising the similarities and differences between the two and the points where we feel that one technology can benefit from ideas or experience  ...  ACKNOWLEDGMENTS We would like to thank the anonymous reviewers as well as the colleagues who provided feedback and encouragement.  ... 
doi:10.1145/1177352.1177354 fatcat:rpyvelu3crgadoptwu3ispmime

Automatic Optimisation of Reliable Collaborative Services in OLSR Mobile Ad Hoc Networks

Christophe Guettier, Philippe Jacquet, Laurent Viennot, Jacques Yelloz
2007 MILCOM 2007 - IEEE Military Communications Conference  
Following a constraint solving method, the paper shows how to maximise a subnet of actors involved in a given collaborative service, while satisfying 2-connectivity, reactivity and communication quality  ...  Future Network based Operations (NbO) will strongly rely on Mobile Ad hoc Networks (MANET), due to urban area, tactical mobility and assymetric operation management.  ...  We demonstrate the approach on simulating real world NbO using both constraint solving programming and discrete event-based simulation of OLSR ad hoc network.  ... 
doi:10.1109/milcom.2007.4454993 fatcat:mdyjfwrt5nb3bljwzk7gkkbkye

Operational framework for recent advances in backtracking search optimisation algorithm: A systematic review and performance evaluation

Bryar A. Hassan, Tarik A. Rashid
2019 Applied Mathematics and Computation  
This paper provides a systematic review and meta-analysis that emphasise on reviewing the related studies and recent developments on BSA.  ...  Hence, the objectives of this work are two-fold: (i) First, two frameworks for depicting the main extensions and the uses of BSA are proposed.  ...  Acknowledgements The authors would like to thank the referees for their remarkable suggestions. This paper's technical content has significantly improved based on their suggestions.  ... 
doi:10.1016/j.amc.2019.124919 fatcat:w53m6amd7rdgbk4cfhtyk6jovu

Optimization in computational systems biology

Julio R Banga
2008 BMC Systems Biology  
Examples are given where optimization methods are used for topics ranging from model building and optimal experimental design to metabolic engineering and synthetic biology.  ...  Optimization aims to make a system or design as effective or functional as possible. Mathematical optimization methods are widely used in engineering, economics and science.  ...  Acknowledgements The author would like to thank Matt Hodgkinson for his valuable comments, and acknowledges financial support from EU project BaSysBio LSHG-CT-2006-037469  ... 
doi:10.1186/1752-0509-2-47 pmid:18507829 pmcid:PMC2435524 fatcat:st2yu6xte5d5hkg2ez3plk4daa

A Metaheuristic Framework for Bi-level Programming Problems with Multi-disciplinary Applications [chapter]

Andrew Koh
2013 Studies in Computational Intelligence  
based optimisation algorithms for the solution of bi-level programming problems.  ...  It is demonstrated that DEBLP is a robust and powerful search heuristic for this class of problems characterised by non smoothness and non convexity.  ...  DEBLP implicitly assumes that the Program L is convex for fixed x and can be solved to global optimality by deterministic methods and that failure to solve the lower level problem to global optimality  ... 
doi:10.1007/978-3-642-37838-6_6 fatcat:m3rvcjqijfgz7fzq2ggqtgjxyi

A review of literature on parallel constraint solving

IAN P. GENT, IAN MIGUEL, PETER NIGHTINGALE, CIARAN MCCREESH, PATRICK PROSSER, NEIL C. A. MOORE, CHRIS UNSWORTH
2018 Theory and Practice of Logic Programming  
; whether to use static or dynamic decomposition; and how to best exploit portfolios and cooperating search.  ...  Yet there seems to be little overall guidance that can be given on how best to exploit multi-core computers to speed up constraint solving.  ...  Acknowledgements We thank Christopher Jefferson for a number of useful discussions, and the reviewers of this journal for their suggestions, which greatly improved this paper.  ... 
doi:10.1017/s1471068418000340 fatcat:42hcmkwlgnayhkmn7w7ypzeh3m
« Previous Showing results 1 — 15 out of 4,888 results