Search Results

Heuristics for Vector Bin Packing (VBP) play an important role in modern distributed computing systems and other applications aimed at optimizing the usage of multidimensional resources. In this paper we perform a systematic classification of ...

• Systematic classification of construction heuristics for the vector bin packing problem.
• Multi-bin activation approach and its theoretical analysis.
• Vectorpack open-source library of item-centric, bin-centric and multi-bin ...

This paper introduces an automatic yard crane scheduling problem with additional assignments of input/output (I/O) points at the block. I/O points are the buffer between the block and the rest of the terminal and containers are relocated from the ...

• Two efficient Greedy Randomized Adaptive Search Procedures (GRASP) for the YCSP.
• A novel constructive heuristic with new sequencing rules (SETR) and improved I/O assignment methods.
• New local search with greedy methods to save CPU ...

Recent trends in customer habits have greatly affected last-mile logistics, increasing the pressure to effectively serve an increasing demand. For traditional postal mail companies, this change is an opportunity to alleviate the decreasing role ...

• Treated districting as a bi-objective problem for the first time.
• Designed border conditions for practical separation of territories.
• Devised a heuristic for handling large, complex spatial distributions.
• Model balances ...

Around the world, efforts are currently underway to implement various decarbonization strategies to meet net-zero emissions objectives. This includes carbon capture and storage (CCS), which involves capturing CO2 at emitter sites, and ...

Traditionally, scheduling literature has focused mainly on solving problems related to processing jobs with non-assembly operations. Despite the growing interest in the assembly literature in recent years, knowledge of the problem is still in its ...

• Scheduling in a 2-stage assembly layout is addressed.
• The total earliness and tardiness minimisation as objective is studied.
• The decision problem depending on the generation of the due dates is analysed.
• Two constructive ...

We solve the Capacitated Vehicle Routing Problem (CVRP) by introducing a novel approach to problem size reduction. We propose the generation of short sequences of nodes called “sections”, which effectively act as single nodes in a reduced CVRP ...

• Comparing three decomposition methods for problem size reductions for CVRPs.
• Evaluating the trade-off between solution quality and computation time.
• Evaluating the trade-off when reducing the problem size by various amounts.
• ...

When dynamic production capacity is considered in production lot-sizing plans, it becomes very challenging to efficiently determine the optimal production plan. Many papers apply “at most one fractional production period” to develop efficient ...

• Provide a novel proposal based on “at least one balance period”.
• Propose a combination of two complementary algorithms as an efficient heuristic method.
• Observe that demand variation could also have significant effects on the ...

This paper introduces the two-level vehicle routing and loading problem (2L-VRLP), an innovative model integrating the two-level bin packing and vehicle routing problems to address real-world logistics challenges that require simultaneous packing ...

Display Omitted

• This paper considers an integrated packing and routing model, 2L-VRLP.
• Innovate the VRLP model with a multi-level packing extension.
• Demonstrate cost-efficiency of 2L-VRLP model in contrast to traditional approaches.
• Develop ...

In this paper, we propose $\mathcal{H}$-Efp, a Portfolio-like multi-agent epistemic planning solver that demonstrates scalability potential and tangible performance improvements compared to state-of-the-art epistemic multi-agent planning systems. Ultimately, ...

High-quality method names are very significant for us to understand programs and maintain software efficiently. Giving concise and consistent method names can help developers understand such programs well, especially for inexperienced ...$$$$$$

This paper investigates the permutation flow shop scheduling problem with peak power constraints under sequence-dependent setup time, learning, and deterioration effects to minimize the makespan, where the peak power consumption satisfies a given ...

• Permutation flow shop scheduling with learning and deterioration effects is solved.
• For the makespan minimization with peak power constraints and sequence-dependent setup time, this problem is NP-hard, and the optimal solution ...

The phenomenon of urbanization, characterized by the migration of people from rural to urban areas, has led to an expansion of existing urban challenges while introducing new ones. Among these, mobility is a primary concern due to its far-...

• Taxonomy definition of multi-objective/perspective urban route navigation policies.
• Heuristic to identify RN policy trade-offs combining city and citizen-vehicle needs.
• A Cloud-Fog-Edge framework to enforce cooperative policies ...

The family traveling salesman problem with incompatibility constraints (FTSP-IC) is a variant of the well-known traveling salesman problem. Given a set of candidate nodes divided into several subsets (families), the FTSP-IC is to find several ...

• The family traveling salesman problem with incompatibility constraints has many applications.
• An intensification-driven search algorithm is presented for solving the problem.
• The algorithm is assessed on 63 benchmark instances.

Given a directed graph $G=(V,A)$, we tackle the Minimum Feedback Arc Set (MFAS) Problem by designing an efficient algorithm to search for minimal and stable Feedback Arc Sets, i.e. such that none of the arcs can be reintroduced in the graph without ...

In recent years, thanks to the fourth industrial revolution, there have been significant increases in the flexibility and agility of industrial processes. In this way, business models based on mass customization of production have gained presence ...

• A review of non-permutation flow shops with missing operations.
• A theoretical analysis of the performance gap of to permutation schedules.
• An efficient solution representation using pseudo jobs.
• A new iterated greedy algorithm ...

As a part of natural language processing (NLP), the intent of topic modeling is to identify topics in textual corpora with limited human input. Current topic modeling techniques, like Latent Dirichlet Allocation (LDA), are limited in the pre-...

• Provides new heuristics for producing a robust stopword list.
• Proposes topic model method based on dimensionality reduction.
• Combines techniques to objectively identify corpus topics.
• Results are more stable and outperform ...

The latency location routing problem integrates the facility location problem and the multi-depot cumulative capacitated vehicle routing problem. This problem involves making simultaneous decisions about depot locations and vehicle routes to ...

• The latency location routing problem is useful for several practical applications.
• We present a learning guided hybrid evolutionary algorithm for solving the problem.
• We show computational results on 76 benchmark instances in the ...

The problem of packing equal circles in a circular container is a classic and famous packing problem, which is well-studied in academia and has a variety of applications in industry. The problem is computationally challenging, and researchers ...

• We propose geometric batch optimization for equal circle packing on large scale.
• We propose several partition strategies for geometric batch optimization.
• An adaptive neighbor object maintenance method is proposed.
• An efficient ...

When enough people leave a project, the project might stall due to lack of knowledgeable personnel. The minimum number of people who are required to disappear in order for a project to stall is referred to as bus-factor. The bus-factor has been ...

We introduce a new problem, called Steiner Multi Cycle Problem, in which we are given a complete weighted graph G = ( V , E ), which respects the triangle inequality, a collection of terminal sets { T 1 , … , T k }, where for each a in [ k ] we ...

• Proof that the Restricted Steiner Multi Cycle Problem (R-SMCP) is NP-hard.
• An effective heuristic that uses geometric and laminar set properties.
• General method to reduce graphs with pickup and delivery pairs to contracted graphs.