• Home
  • Search
  • Variable Neighborhood Search Algorithm for the Variable Cost and Size Bin Packing Problem
  • Cite Icon1
  • https://doi.org/10.4018/978-1-5225-8131-4.ch001Copy DOI Icon

Variable Neighborhood Search Algorithm for the Variable Cost and Size Bin Packing Problem

  • Jan 1, 2019
  • Héctor J Fraire-Huacuja +6 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

A company that transports goods to supply customers usually needs to plan the routes that the fleet must follow, since transportation means a high percentage of the value added to goods. The vehicles must be loaded with the products located in the warehouse to fulfill the orders requested by customers. Many enterprises use order batching and picking systems to improve the warehouse management. This chapter describes a novel algorithm based on the methodology of variable neighborhood search for the variable cost and size bin packing problem. This problem considers that the sizes and costs of the bins can be different and there is no correlation between them, which is a sensible assumption for the order batching process in many applications. A series of computational experiments were conducted with a set of hard instances to validate this approach. The results show that the proposed algorithm outperforms the state-of-the-art algorithm, and a statistical hypothesis test is used to support the obtained conclusions.

Similar Papers
  • Conference Article
  • Citations5

Three-dimensional bin packing problem with variable bin length Application in industrial storage problem

  • May 01, 2011
  • Mezghani Salma +1
  • Conference Article
  • Citations12

Location Based Cloud Resource Management for Analyzing Real-Time Videos from Globally Distributed Network Cameras

  • Dec 01, 2016
  • Anup Mohan +3
  • Research Article
  • Citations38

Variable Sized Bin Packing With Color Constraints

  • Apr 01, 2001
  • Electronic Notes in Discrete Mathematics
  • Milind Dawande +2
  • Research Article
  • Citations10

Joint optimization of storage assignment and order batching in robotic mobile fulfillment system with dynamic storage depth and surplus items

  • Feb 01, 2025
  • Computers & Industrial Engineering
  • Zhi Liu +5
  • Supplementary Content
  • Citations5

Interpreting “statistical hypothesis testing” results in clinical research

  • Jan 01, 2012
  • Journal of Ayurveda and Integrative Medicine
  • Sanjeev B Sarmukaddam
  • Research Article
  • Citations1

Statistical Inference as Severe Testing: How to Get beyond the Statistics

  • Jan 01, 2021
  • The Philosophical Review
  • Conor Mayo-Wilson
  • Conference Article
  • Citations6

Energy-Efficient Real-Time Task Allocation in a Data Center

  • Dec 01, 2016
  • Mingming Zhang +4
  • Book Chapter

Combining Two-Phase Local Search with Multi-objective Ant Colony Optimization

  • Jan 01, 2018
  • Chun-Wa Leung +2
  • Research Article
  • Citations11

A new MILP model and fast heuristics for the variable-sized bin packing problem with time windows

  • Nov 29, 2022
  • Computers & Industrial Engineering
  • Krzysztof Fleszar
  • PDF
  • Research Article
  • Citations4

Statistical hypothesis testing: general approach in medical research

  • Aug 08, 2022
  • Sechenov Medical Journal
  • A Yu Suvorov +6
  • Research Article
  • Citations12

A large neighborhood search algorithm and lower bounds for the variable-Sized bin packing problem with conflicts

  • Jan 02, 2023
  • European Journal of Operational Research
  • Ali Ekici
  • Research Article
  • Citations41

A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times

  • Feb 15, 2020
  • European Journal of Operational Research
  • Gonzalo Mejía +1
  • PDF
  • Research Article
  • Citations3

An Evolutionary Variable Neighbourhood Search for the Unrelated Parallel Machine Scheduling Problem

  • Jan 01, 2021
  • IEEE Access
  • Salwani Abdullah +3
  • Conference Article
  • Citations3

Solving the Multi-activity Shift Scheduling Problem using Variable Neighbourhood Search

  • Jan 01, 2020
  • Yi Qu +1
  • Book Chapter
  • Citations1

Hybridization of Variable Neighborhood Search and Simulated Annealing for the Collaborative Truck-Drone Routing Problem

  • Jan 01, 2022
  • Qizhang Luo +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.