The capacitated mobile facility location problem

DOI10.1016/J.EJOR.2019.02.055zbMATH Open1430.90384OpenAlexW2920930353MaRDI QIDQ1737488FDOQ1737488

Authors: Xianqiang Yang 

Publication date: 23 April 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://cdm21054.contentdm.oclc.org/cdm/ref/collection/IR/id/9550

Recommendations

• Local search heuristics for the mobile facility location problem
• Minimizing movement in mobile facility location problems
• An effective heuristic for large-scale capacitated facility location problems
• Local-search based approximation algorithms for mobile facility location problems (extended abstract)
• Mobile facility location: combinatorial filtering via weighted occupancy

zbMATH Keywords

local searchlocationcolumn generationbranch-and-pricecapacitated mobile facilities

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Cites Work

• Title not available (Why is that?)
• A survey of algorithms for the generalized assignment problem
• An exact algorithm for the capacitated facility location problems with single sourcing
• A column generation approach to capacitated \(p\)-median problems
• A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• Upper and lower bounds for the single source capacitated location problem.
• Location of preventive health care facilities
• A cut-and-solve based algorithm for the single-source capacitated facility location problem
• A heuristic for BILP problems: the single source capacitated facility location problem
• Dynamic-demand capacitated facility location problems with and without relocation
• A branch-and-price algorithm for the capacitated facility location problem
• Minimizing movement
• Euclidean movement minimization
• Combining very large scale and ILP based neighborhoods for a two-level location problem
• Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
• Multicriteria tour planning for mobile healthcare facilities in a developing country
• An exact method for the two-echelon, single-source, capacitated facility location problem
• Exactly solving a two-level location problem with modular node capacities
• An LP-based heuristic for two-stage capacitated facility location problems
• Minimizing movement in mobile facility location problems
• Local search heuristics for the mobile facility location problem
• A branch‐and‐price algorithm for the capacitated p‐median problem
• Local-search based approximation algorithms for mobile facility location problems (extended abstract)
• An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
• Mobile facility location: combinatorial filtering via weighted occupancy
• Matheuristics for the capacitated p-Median problem

Cited In (9)

• Relief aid provision to en route refugees: multi-period mobile facility location with mobile demand
• Minimizing movement in mobile facility location problems
• Dynamic location of modular manufacturing facilities with relocation of individual modules
• On the impact of resource relocation in facing health emergencies
• A capacitated biobjective location problem with uniformly distributed demands in the UAV‐supported delivery operation
• Local search heuristics for the mobile facility location problem
• The multi-period \(p\)-center problem with time-dependent travel times
• Mobile facility location: combinatorial filtering via weighted occupancy
• The median routing problem for simultaneous planning of emergency response and non-emergency jobs

This page was built for publication: The capacitated mobile facility location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1737488)