A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem

A two-stage robust optimization approach for the mobile facility fleet sizing and routing problem under uncertainty

“…The most relevant research to our problem are studied by Halper and Raghavan (2011) and Lei et al (2014). Halper and Raghavan presented a continuous time formulation to model the maximum covering mobile facility routing problem for both single and multiple facilities under deterministic conditions.…”

“…For instance, light trucks equipped with cellular base stations provide cellular services to areas where the established cellular network is temporarily insufficient (Halper and Raghavan, 2011). Also, vans provide fast food services to customers in different regions in different time periods of the day (Lei et al, 2014). Note that when these vehicles are in service, they behave like traditional facilities, and the duration that the vehicle stays at a customer point is directly related to the amount of service provided.…”

“…In this paper, we use the term Mobile Facility (MF) to denote this "facility-like-vehicle". The MFs considered here share the same features as those shown in Lei et al (2014): 1) the demand served at a location is proportional to the duration of time an MF remains stationary at that location, 2) the MFs cannot provide services when they are in motion, and 3) the service begins when an MF arrives at a location and ends when it departs. We illustrate these features through a simple example as shown in Figure 1.…”

A Survey of Recent Research on Optimization Models and Algorithms for Operations Management from the Process View

“…In general, the penalty cost is raised from the punctuality of delivery [164,182,183,195], the ability of meeting the demands [187,189,196], the capability of vehicles [184,197], waste of product [193], congestion charge [198], and so forth.…”

Acelerando a Decomposição De Benders Estocástica Para Otimização De Um Modelo De Gestão De Estoque De Revisão Periódica (R, S) Com Backorder Parcial E Demanda Incerta

“…Benders (1962) propôs um método de decomposição para resolução de problemas de programação inteira mista que vem sendo aplicado com sucesso a problemas em diversos contextos (Geoffrion & Graves, 1974;Magnanti et al, 1986;Costa, 2005;Camargo et al, 2009 …”