Results 31 to 40 of about 3,752,335 (283)
Promet (Zagreb), 2019 Providing a satisfying delivery service is an important way to maintain the customers’ loyalty and further expand profits for manufacturers and logistics providers.
Manman Li, Jian Lu, Wenxin Ma
doaj +1 more source
Metaheuristic for Solving Multi-Objective Job Shop Scheduling Problem in a Robotic Cell
IEEE Access, 2020 This paper deals with the multi-objective job shop scheduling problem in a robotic cell (MOJRCSP). All the jobs are processed according to their operations order on workstations.
Xiaohui Li +4 more
doaj +1 more source
Adaptive search techniques for problems in vehicle routing, part II: A numerical comparison [PDF]
Yugoslav Journal of Operations Research, 2015 Research in the field of vehicle routing often focused on finding new ideas and concepts in the development of fast and efficient algorithms for an improved solution process. Early studies introduce static tailor-made strategies, but trends show
Kritzinger Stefanie +3 more
doaj +1 more source
2009 21st IEEE International Conference on Tools with Artificial Intelligence, 2009 In this paper a learning based local search approach for propositional satisfiability is presented. It is based on an original adaptation of the conflict driven clause learning (CDCL) scheme to local search. First an extended implica- tion graph for complete assignments of the set of variables is proposed.
Audemard, Gilles +3 more
openaire +2 more sources
, 2022 AbstractImprovement methods constitute the backbone of most metaheuristics. These methods repeatedly perform slight, local modifications on a current solution to the problem. Hence, for any solution, a set of neighbor solutions must be defined. Clearly, the definition of this set depends on the problem modeling. However, a natural neighborhood may turn
openaire +1 more source
Hybrid Gravitational Search Algorithm Based on Fuzzy Logic
IEEE Access, 2017 Gravitational search algorithm (GSA) is a novel heuristic optimization algorithm which is used to search for the global optimal solution by iteration. However, GSA is easy to fall into local minima and convergence slowly.
Kun Qian, Wei Li, Weiyi Qian
doaj +1 more source
Tight Load Balancing via Randomized Local Search
, 2017 We consider the following balls-into-bins process with $n$ bins and $m$ balls: each ball is equipped with a mutually independent exponential clock of rate 1.
Berenbrink, Petra +3 more
core +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Pediatric gastroenteropancreatic neuroendocrine neoplasms (GEP‐NENs) are extremely rare and clinically heterogeneous. Management has largely been extrapolated from adult practice. This European Standard Clinical Practice Guideline (ESCP), developed by the EXPeRT network in collaboration with adult NEN experts, provides (adult) evidence ...
Michaela Kuhlen +23 more
wiley +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Oral mucositis is a common and debilitating side effect of childhood cancer and stem cell transplant treatments. It affects the quality of life of children and young people (CYP) and places a strain on services. Photobiomodulation is recommended for oral mucositis prevention in international guidance but is poorly implemented in UK ...
Claudia Heggie +4 more
wiley +1 more source
Tabu Search-Based Heuristic Solver for General Integer Linear Programming Problems
IEEE AccessThis paper presents a tabu search-based heuristic solver for general integer linear programming (ILP) problems as a dependable alternative to branch-and-bound (B&B) solvers.
Yuji Koguma
doaj +1 more source