Results 81 to 90 of about 109,601 (167)

Adaptive Large Neighborhood Search for a Flexible Truck–Drone Routing Problem with Multi-Visit and Cost Trade-Offs

World Electric Vehicle Journal
Extending the truck–drone mothership system, this paper addresses a flexible multi-visit truck and drone joint routing problem (FMTDJRP). A mixed integer linear program is proposed to minimize total travel cost. An adaptive large neighborhood search with
Jiang Bian, Rui Zhou, Qingbin Meng
doaj   +1 more source

A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction [PDF]

The bi-objective winner determination problem (2WDP-SC) of a combinatorial procurement auction for transport contracts comes up to a multi-criteria set covering problem. We are given a set B of bundle bids.
Buer, Tobias, Kopfer, Herbert
core   +1 more source

Adaptive large neighborhood search for the commodity constrained split delivery VRP

Computers & Operations Research, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gu, Wenjuan, Cattaruzza, Diego, Ogier, Maxime, Semet, Frédéric   +3 more
openaire   +4 more sources

Research on Urban Cold Chain Logistics Path Optimization Considering Multi-Center and Time-Varying Road Networks

IEEE Access
This paper aims to address the time-dependent multi-depot vehicle routing problem with time windows (MDVRPTW) in urban cold chain logistics under a dynamic road network.
Xiaochun Yang, Huiyuan Jiang
doaj   +1 more source

The Influence of Intelligent Guided Vehicle Configuration on Equipment Scheduling in the Railway Yards of Automated Container Terminals

Journal of Marine Science and Engineering
The efficiency of collecting and distributing goods has been improved by establishing railway lines that serve new automated container terminals (ACTs) and by constructing central railway stations close to ports.
Hongbin Chen, Wei Liu
doaj   +1 more source

ParBalans: Parallel Multi-Armed Bandits-based Adaptive Large Neighborhood Search

Solving Mixed-Integer Programming (MIP) problems often requires substantial computational resources due to their combinatorial nature. Parallelization has emerged as a critical strategy to accelerate solution times and enhance scalability to tackle large, complex instances.
Yilmaz, Alican, Cai, Junyang, Kadioglu, Serdar, Dilkina, Bistra   +3 more
openaire   +2 more sources

An improved multiobjective evolutionary algorithm for time-dependent vehicle routing problem with time windows

Egyptian Informatics Journal
Time-dependent vehicle routing problem with time windows (TDVRPTW) is a pivotal problem in logistics domain. In this study, a special case of TDVRPTW with temporal-spatial distance (TDVRPTW-TSD) is investigated, which objectives are to minimize the total
Jia-ke Li, Jun-qing Li, Ying Xu
doaj   +1 more source

A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times [PDF]

, 2012
Muller, Laurent Flindt, Pisinger, David, Spoorendonk, Simon   +2 more
core   +1 more source

Local Search Techniques for Constrained Portfolio Selection Problems

, 2001
We consider the problem of selecting a portfolio of assets that provides the investor a suitable balance of expected return and risk. With respect to the seminal mean-variance model of Markowitz, we consider additional constraints on the cardinality of ...
Schaerf, Andrea
core   +1 more source

Self-adaptive exploration in evolutionary search

, 2001
We address a primary question of computational as well as biological research on evolution: How can an exploration strategy adapt in such a way as to exploit the information gained about the problem at hand?
Toussaint, Marc
core   +3 more sources