Home << 1 >>
List View
 | 
Citations
 | 
Details
   web
Records
Author Alvarez-Miranda, E.; Pereira, J.
Title (up) A Districting Application with a Quality of Service Objective Type
Year 2022 Publication Mathematics Abbreviated Journal Mathematics
Volume 10 Issue 1 Pages 13
Keywords districtin; glast-mile delivery; hybrid heuristics
Abstract E-commerce sales have led to a considerable increase in the demand for last-mile delivery companies, revealing several problems in their logistics processes. Among these problems, are not meeting delivery deadlines. For example, in Chile, the national consumer service (SERNAC) indicated that in 2018, late deliveries represented 23% of complaints in retail online sales and were the second most common reason for complaints. Some of the causes are incorrectly designed delivery zones because in many cases, these delivery zones do not account for the demographic growth of cities. The result is an imbalanced workload between different zones, which leads to some resources being idle while others fail to meet their workload in satisfactory conditions. The present work proposes a hybrid method for designing delivery zones with an objective based on improving the quality of express delivery services. The proposed method combines a preprocess based on the grouping of demand in areas according to the structure of the territory, a heuristic that generates multiple candidates for the distribution zones, and a mathematical model that combines the different distribution zones generated to obtain a final territorial design. To verify the applicability of the proposed method, a case study is considered based on the real situation of a Chilean courier company with low service fulfillment in its express deliveries. The results obtained from the computational experiments show the applicability of the method, highlighting the validity of the aggregation procedure and improvements in the results obtained using the hybrid method compared to the initial heuristic. The final solution improves the ability to meet the conditions associated with express deliveries, compared with the current situation, by 12 percentage points. The results also allow an indicative sample of the critical service factors of a company to be obtained, identifying the effects of possible changes in demand or service conditions
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 2227-7390 ISBN Medium
Area Expedition Conference
Notes WOS:000751158600001 Approved
Call Number UAI @ alexi.delcanto @ Serial 1529
Permanent link to this record
 
 
Author Alvarez-Miranda, E.; Pereira, J.; Torrez-Meruvia H.; Vila, M.
Title (up) A Hybrid Genetic Algorithm for the Simple Assembly Line Balancing Problem with a Fixed Number of Workstations Type
Year 2021 Publication Mathematics Abbreviated Journal Mathematics
Volume 9 Issue 17 Pages 2157
Keywords assembly lines; manufacturing; line balancing; hybrid genetic algorithm
Abstract The assembly line balancing problem is a classical optimisation problem whose objective is to assign each production task to one of the stations on the assembly line so that the total efficiency of the line is maximized. This study proposes a novel hybrid method to solve the simple version of the problem in which the number of stations is fixed, a problem known as SALBP-2. The hybrid differs from previous approaches by encoding individuals of a genetic algorithm as instances of a modified problem that contains only a subset of the solutions to the original formulation. These individuals are decoded to feasible solutions of the original problem during fitness evaluation in which the resolution of the modified problem is conducted using a dynamic programming based approach that uses new bounds to reduce its state space. Computational experiments show the efficiency of the method as it is able to obtain several new best-known solutions for some of the benchmark instances used in the literature for comparison purposes.
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 2227-7390 ISBN Medium
Area Expedition Conference
Notes WOS:000694360700001 Approved
Call Number UAI @ alexi.delcanto @ Serial 1466
Permanent link to this record
 
 
Author Alvarez-Miranda, E.; Campos-Valdes, C.; Quiroga, M.M.; Moreno-Faguett, M.; Pereira, J.
Title (up) A Multi-Criteria Pen for Drawing Fair Districts: When Democratic and Demographic Fairness Matter Type
Year 2020 Publication Mathematics Abbreviated Journal Mathematics
Volume 8 Issue 9 Pages 27 pp
Keywords multi-criteria optimization; OR applications; malapportionment; districting; electoral system
Abstract Electoral systems are modified by individuals who have incentives to bias the rules for their political advantage (i.e., gerrymandering). To prevent gerrymandering, legislative institutions can rely on mathematical tools to guarantee democratic fairness and territorial contiguity. These tools have been successfully used in the past; however, there is a need to accommodate additional meanings of the term fairness within the electoral systems of modern democracies. In this paper, we present an optimization framework that considers multiple criteria for drawing districts and assigning the number of representatives. Besides some typical districting criteria (malapportionment and contiguity), we introduce novel criteria for ensuring territorial equilibrium and incentives for candidates to deploy their representation efforts fairly during their campaign and period in office. We test the method, which we denote as Multi-criteria Pen, in a recent and a forthcoming reform of the Chilean electoral system. The results show the potential of our tool to improve the current territorial design and offers insights on the motivations, objectives, and deficiencies of both reform plans.
Address [Alvarez-Miranda, Eduardo; Moreno-Faguett, Magas] Univ Talca, Fac Engn, Dept Ind Engn, Campus Curico, Curico 3341717, Chile, Email: ealvarez@utalca.cl;
Corporate Author Thesis
Publisher Mdpi Place of Publication Editor
Language English Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 2227-7390 ISBN Medium
Area Expedition Conference
Notes WOS:000580771600001 Approved
Call Number UAI @ alexi.delcanto @ Serial 1246
Permanent link to this record
 
 
Author Sandoval, G.; Alvarez-Miranda, E.; Pereira, J.; Rios-Mercado, R.Z.; Diaz, J.A.
Title (up) A novel districting design approach for on-time last-mile delivery: An application on an express postal company Type
Year 2022 Publication Omega-International Journal Of Management Science Abbreviated Journal Omega-Int. J. Manage. Sci.
Volume 113 Issue Pages 102687
Keywords Districting; Last-mile delivery; Postal delivery; Supply chain management; Heuristics
Abstract Last-mile logistics corresponds to the last leg of the supply chain, i.e., the delivery of goods to final cus-tomers, and they comprise the core activities of postal and courier companies. Because of their role in the supply chain, last-mile operations are critical for the perception of customers regarding the perfor-mance of the whole logistic process. In this sense, the sustained growth of e-commerce, which has been abruptly catalyzed by the irruption of the COVID-19 pandemic, has hanged the habits of customers and overtaxed the operational side of delivery companies, hindering their viability and forcing their adap-tation to the novel conditions. Many of these habits will remain after we overcome the sanitary crisis, which will permanently reshape the structure and emphasis of postal supply chains, demanding compa-nies to implement organizational and operational changes to adapt to these new challenges. In this work we address a last-mile logistic design problem faced by a courier and delivery company in Chile, although the same problem is likely to arise in the last-mile delivery operation of other postal companies, in particular in the operation of express delivery services. The operational structure of the company is based on the division of an urban area into smaller territories (districts) and the outsourcing of the delivery operation of each territory to a last-mile contractor. Because of the increasing volume of postal traffic and a decreasing performance of the service, in particular for the case of express deliveries, the company is forced to redesign its current territorial arrangement. Such redesign results in a novel optimization problem that resembles a classical districting problem with the additional quality of service requirements. This novel problem is first formulated as a mathematical programming model and then a specially tailored heuristic is designed for solving it. The proposed approach is tested on instances from the real-life case study, and the obtained results show significant improvements in terms of the percent-age of on-time deliveries achieved by the proposed solution when compared to the current districting design of the company. By performing a sensitivity analysis considering different levels of demand, we show that the proposed approach is effective in providing districting designs capable of enduring signifi-cant increases in the demand for express postal services.
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 0305-0483 ISBN Medium
Area Expedition Conference
Notes WOS:000809666900001 Approved
Call Number UAI @ alexi.delcanto @ Serial 1605
Permanent link to this record
 
 
Author Pereira, J.; Alvarez-Miranda, E.
Title (up) An exact approach for the robust assembly line balancing problem Type
Year 2018 Publication Omega-International Journal Of Management Science Abbreviated Journal Omega-Int. J. Manage. Sci.
Volume 78 Issue Pages 85-98
Keywords Line balancing; Robust optimization; Lower bounds; Branch-and-bound
Abstract This work studies an assembly line balancing problem with uncertainty on the task times. In order to deal with the uncertainty, a robust formulation to handle changes in the operation times is put forward. In order to solve the problem, several lower bounds, dominance rules and an enumeration procedure are proposed. These methods are tested in a computational experiment using different instances derived from the literature and then compared to similar previous approaches. The results of the experiment show that the method is able to solve larger instances in shorter running times. Furthermore, the cost of protecting a solution against uncertainty is also investigated. The results highlight that protecting an assembly line against moderate levels of uncertainty can be achieved at the expense of small quantities of additional resources (stations). (C) 2017 Elsevier Ltd. All rights reserved.
Address [Pereira, Jordi] Univ Adolfo Ibanez, Fac Engn & Sci, Av Pedro Hurtado 750,Off A-215, Vina Del Mar, Chile, Email: jorge.pereira@uai.cl
Corporate Author Thesis
Publisher Pergamon-Elsevier Science Ltd Place of Publication Editor
Language English Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 0305-0483 ISBN Medium
Area Expedition Conference
Notes WOS:000433266700007 Approved
Call Number UAI @ eduardo.moreno @ Serial 872
Permanent link to this record
 
 
Author Opazo, D.; Moreno, S.; Alvarez-Miranda, E.; Pereira, J.
Title (up) Analysis of First-Year University Student Dropout through Machine Learning Models: A Comparison between Universities Type
Year 2021 Publication Mathematics Abbreviated Journal Mathematics
Volume 20 Issue 9 Pages 2599
Keywords machine learning; first-year student dropout; universities
Abstract Student dropout, defined as the abandonment of a high education program before obtaining the degree without reincorporation, is a problem that affects every higher education institution in the world. This study uses machine learning models over two Chilean universities to predict first-year engineering student dropout over enrolled students, and to analyze the variables that affect the probability of dropout. The results show that instead of combining the datasets into a single dataset, it is better to apply a model per university. Moreover, among the eight machine learning models tested over the datasets, gradient-boosting decision trees reports the best model. Further analyses of the interpretative models show that a higher score in almost any entrance university test decreases the probability of dropout, the most important variable being the mathematical test. One exception is the language test, where a higher score increases the probability of dropout.
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 2227-7390 ISBN Medium
Area Expedition Conference
Notes Approved
Call Number UAI @ alexi.delcanto @ Serial 1463
Permanent link to this record
 
 
Author Alvarez-Miranda, E.; Pereira, J.; Vila, M.
Title (up) Analysis of the simple assembly line balancing problem complexity Type
Year 2023 Publication Computers & Operations Research Abbreviated Journal Comput. Oper. Res.
Volume 159 Issue Pages 106323
Keywords Manufacturing; Assembly line balancing; Packing; Precedence constraints; Instance sets
Abstract The simple assembly line balancing problem (SALBP) involves the determination of the assignment of elementary assembly operations to the workstations of the assembly line for the manufacture of a final product, with the objective of maximising assembly efficiency. In addition to its practicality, the SALBP can be considered as an extension of the bin packing problem (BPP) to account for the precedence relations between items. These constraints introduce an ordering component to the problem, which increases the complexity of SALBP resolution. However, previous studies indicated that precedence constraints do not play an important role in the capacity of state-of-the-art procedures to solve benchmark instances to optimality. In this study, we analysed the influences of different features of an SALBP instance on the performance of state-of-the-art solution methods for the abovementioned problem. First, we provide an alternative proof of complexity for the SALBP that uses precedence constraints to demonstrate its non-deterministic polynomial time (NP)-complete status, followed by a new set of benchmark instances directed towards an empirical analysis of the different features of SALBP instances. The experimental results revealed that the packing features of the SALBP are a major source of the perceived difficulty for any instance; however, precedence constraints play a role in the performance of these solution procedures. Specifically, the number of precedence constraints plays an important role in the results obtained from state-of-the-art methods. In addition to the analysis, certain issues that were identified in the publicly available implementations of the state-of-the-art method for resolving this problem were addressed in this study.
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 0305-0548 ISBN Medium
Area Expedition Conference
Notes WOS:001033536100001 Approved
Call Number UAI @ alexi.delcanto @ Serial 1849
Permanent link to this record
 
 
Author Alvarez-Miranda, E.; Chace, S.; Pereira, J.
Title (up) Assembly line balancing with parallel workstations Type
Year 2021 Publication International Journal Of Production Research Abbreviated Journal Int. J. Prod. Res.
Volume 59 Issue 21 Pages 6486-6506
Keywords Line balancing; parallel stations; dynamic programming; hybrid metaheuristic; matheuristic
Abstract The simple assembly line balancing problem (SALBP) considers work division among different workstations of a serially arranged assembly process to maximise its efficiency under workload (cumulative) and technological (precedence) constraints. In this work, we consider a variant of the SALBP which allows parallel workstations. To study the effect of parallel stations, we propose a new problem (the parallel station assembly line balancing problem or PSALBP) in which the objective is to minimise the number of parallel stations required to obtain the maximum theoretical efficiency of the assembly process. We study the complexity of the problem and identify a polynomially solvable case. This result is then used as a building block for the development of a heuristic solution procedure. Finally, we carry out a computational experiment to identify the characteristics of assembly lines that may benefit from station paralleling and to evaluate the performance of the proposed heuristic.
Address [alvarez-Miranda, Eduardo] Univ Talca, Fac Engn, Dept Ind Engn, Curico, Chile, Email: jorge.pereira@uai.cl
Corporate Author Thesis
Publisher Taylor & Francis Ltd Place of Publication Editor
Language English Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 0020-7543 ISBN Medium
Area Expedition Conference
Notes WOS:000569837900001 Approved
Call Number UAI @ alexi.delcanto @ Serial 1243
Permanent link to this record
 
 
Author Vargas-Ferrer, P.; Alvarez-Miranda, E.; Tenreiro, C.; Jalil-Vega, F.
Title (up) Assessing flexibility for integrating renewable energies into carbon neutral multi-regional systems: The case of the Chilean power system Type
Year 2022 Publication Energy for Sustainable Development Abbreviated Journal Energy Sustain. Dev.
Volume 70 Issue Pages 442-455
Keywords Power system energy planning; OSeMOSYS; Concentrating solar power; Storage; Decarbonization; Carbon neutral; Flexibility
Abstract Reducing emissions from power systems requires enhancing the penetration of non-conventional renewable energy sources (NCRE) in the generation mix. However, such penetration requires high levels of operational flexibility in order to ensure an adequate balance between generation and demand. Concentrating solar power plants with thermal storage (CSP-TES) and battery energy storage systems (BESS) have shown to possess technical characteristics compatible with such high flexibility requirements. However, due to the high capital costs of these technologies, decision-makers must seek for cost-effective configurations and operation modes. This study presents the development of a methodological framework for designing the long-term transition of a multi-regional energy system towards a low carbon emission system. The sought system is characterized by a high penetration of NCRE, and the use of CSP-TES, BESS and electricity transmission settings for providing effective levels of operational flexibility. For this, the transformation of the Chilean electricity system between the years 2018-2050 is studied, using a tailored modification of the well-known OSeMOSYS optimization tool for energy systems planning. The main results indicate that by 2050, and considering a baseline scenario defined for 2016, for most of the scenarios studied the renewable electricity generation would be at least a 90 % and CO2 emissions would be 75 % lower. Furthermore, it is shown that providing operational flexibility to the system requires a mixed generation from hydroelectric reservoirs, CSP-TES plants, BESS, pumped-storage hydropower and natural gas generators. The obtained results allow planning the capacity and operation of CSP and BESS plants, which are adapted to the future flexibility requirements of the Chilean electric power system. Incentive policies like stimuli to growth BESS, would favor primarily the photovoltaic growth of the system at the expense of CSP-TES capacity, while CSP-TES growth incentives would maintain photovoltaic generation levels, but would decrease Wind and natural gas generation.
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 0973-0826 ISBN Medium
Area Expedition Conference
Notes WOS:000863285300002 Approved
Call Number UAI @ alexi.delcanto @ Serial 1685
Permanent link to this record
 
 
Author Alvarez-Miranda, E.; Pereira, J.
Title (up) Designing and constructing networks under uncertainty in the construction stage: Definition and exact algorithmic approach Type
Year 2017 Publication Computers & Operations Research Abbreviated Journal Comput. Oper. Res.
Volume 81 Issue Pages 178-191
Keywords Network design; Network construction; Two-stage robust optimization; Exact algorithms
Abstract The present work proposes a novel Network Optimization problem whose core is to combine both network design and network construction scheduling under uncertainty into a single two-stage robust optimization model. The first-stage decisions correspond to those of a classical network design problem, while the second-stage decisions correspond to those of a network construction scheduling problem (NCS) under uncertainty. The resulting problem, which we will refer to as the Two-Stage Robust Network Design and Construction Problem (2SRNDC), aims at providing a modeling framework in which the design decision not only depends on the design costs (e.g., distances) but also on the corresponding construction plan (e.g., time to provide service to costumers). We provide motivations, mixed integer programming formulations, and an exact algorithm for the 2SRNDC. Experimental results on a large set of instances show the effectiveness of the model in providing robust solutions, and the capability of the proposed algorithm to provide good solutions in reasonable running times. (C) 2017 Elsevier Ltd. All rights reserved.
Address [Alvarez-Miranda, Eduardo] Univ Talca, Dept Ind Engn, Curico, Chile, Email: ealvarez@utalca.cl
Corporate Author Thesis
Publisher Pergamon-Elsevier Science Ltd Place of Publication Editor
Language English Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 0305-0548 ISBN Medium
Area Expedition Conference
Notes WOS:000394079400015 Approved
Call Number UAI @ eduardo.moreno @ Serial 706
Permanent link to this record
 
 
Author Vargas-Ferrer, P.; Alvarez-Miranda, E.; Tenreiro, C.; Jalil-Vega, F.
Title (up) Integration of high levels of electrolytic hydrogen production: Impact on power systems planning Type
Year 2023 Publication Journal Of Cleaner Production Abbreviated Journal J. Clean. Prod.
Volume 409 Issue Pages 137110
Keywords
Abstract The increasing interest in electrolytic hydrogen production using renewable electricity sources will require to adapt power systems to new electrical loads for hydrogen production and supply chains. Such high loads would impact the long-term planning and operation of power systems, as they need to balance the variability of renewable generation sources with electricity demand. This stresses the importance of characterizing the impact of incorporating hydrogen supply chains into power systems and planning accordingly. This study proposes a methodological framework to assess the integration and development of a national power system with electrolytic hydrogen production and supply chain. The framework is based on the well-known optimization tool for energy systems planning, Open Source Energy Modeling System (OSeMOSYS). For a detailed representation, a module was developed where demand side technologies &#65533; such as those associated to hydrogen supply chains &#65533; can provide operating reserves. As a case study, the integration of the Chilean power system with a hydrogen supply chain for exporting hydrogen between 2018 and 2050 was modeled. Among other findings, results indicate that an on-grid hydrogen supply chain would be more cost-effective than an off-grid one. However, the new electrical loads originated from such hydrogen supply chain would require additional generation capacity &#65533; primarily photovoltaic. Other generation capacities such as concentrated solar power, wind, and storage would experience significant variations in their investment requirements, compared to the off-grid hydrogen supply chain scenario. The study revealed that the coordinated operation of electrolyzers is crucial to the operational flexibility of the new electrical system.
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 0959-6526 ISBN Medium
Area Expedition Conference
Notes WOS:000988664900001 Approved
Call Number UAI @ alexi.delcanto @ Serial 1812
Permanent link to this record
 
 
Author Alvarez-Miranda, E.; Pereira, J.
Title (up) On the complexity of assembly line balancing problems Type
Year 2019 Publication Computers & Operations Research Abbreviated Journal Comput. Oper. Res.
Volume 108 Issue Pages 182-186
Keywords Line balancing; Complexity; Bin packing
Abstract Assembly line balancing is a family of combinatorial optimization problems that has been widely studied in the literature due to its simplicity and industrial applicability. Most line balancing problems are NP-hard as they subsume the bin packing problem as a special case. Nevertheless, it is common in the line balancing literature to cite [A. Gutjahr and G. Nemhauser, An algorithm for the line balancing problem, Management Science 11 (1964) 308-315] in order to assess the computational complexity of the problem. Such an assessment is not correct since the work of Gutjahr and Nemhauser predates the concept of NP-hardness. This work points at over 50 publications since 1995 with the aforesaid error. (C) 2019 Elsevier Ltd. All rights reserved.
Address [Alvarez-Miranda, Eduardo] Univ Talca, Dept Ind Engn, Curico, Chile, Email: jorge.pereira@uai.cl
Corporate Author Thesis
Publisher Pergamon-Elsevier Science Ltd Place of Publication Editor
Language English Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 0305-0548 ISBN Medium
Area Expedition Conference
Notes WOS:000471733300014 Approved
Call Number UAI @ eduardo.moreno @ Serial 1015
Permanent link to this record
 
 
Author Campos-Valdes, C.; Alvarez-Miranda, E.; Quiroga, MM; Pereira, J.; Duran, FL.
Title (up) The Impact of Candidates' Profile and Campaign Decisions in Electoral Results: A Data Analytics Approach Type
Year 2021 Publication Mathematics Abbreviated Journal Mathematics
Volume 9 Issue 8 Pages 902
Keywords Chilean parliamentary election; candidate profiles; campaign efforts; territorial deployment
Abstract In recent years, a wide range of techniques has been developed to predict electoral results and to measure the influence of different factors in these results. In this paper, we analyze the influence of the political profile of candidates (characterized by personal and political features) and their campaign effort (characterized by electoral expenditure and by territorial deployment strategies retrieved from social networks activity) on the electoral results. This analysis is carried out by using three of the most frequent data analyitcs algorithms in the literature. For our analysis, we consider the 2017 Parliamentary elections in Chile, which are the first elections after a major reform of the electoral system, that encompassed a transition from a binomial to a proportional system, a modification of the districts' structure, an increase in the number of seats, and the requirement of gender parity in the lists of the different coalitions. The obtained results reveal that, regardless of the political coalition, the electoral experience of candidates, in particular in the same seat they are running for (even when the corresponding district is modified), is by large the most influential factor to explain the electoral results. However, the attained results show that the influence of other features, such as campaign expenditures, depends on the political coalition. Additionally, by means of a simulation procedure, we show how different levels of territorial deployment efforts might impact on the results of candidates. This procedure could be used by parties and coalitions when planning their campaign strategies.
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 2227-7390 ISBN Medium
Area Expedition Conference
Notes WOS:000644524000001 Approved
Call Number UAI @ alexi.delcanto @ Serial 1377
Permanent link to this record
 
 
Author Alvarez-Miranda, E.; Pereira, J.; Vargas, C.; Vila, M.
Title (up) Variable-depth local search heuristic for assembly line balancing problems Type
Year 2022 Publication International Journal Of Production Research Abbreviated Journal Int. J. Prod. Res.
Volume 61 Issue 9 Pages 3103-3121
Keywords Assembly lines; Manufacturing; simple assembly line balancing; local search; variable-depth local search
Abstract Assembly lines are production flow systems wherein activities are organised around a line consisting of various workstations through which the product flows. At each station, the product is assembled through a subset of operations. The assembly line balancing problem (ALBP) consists of allocating operations between stations to maximise the system efficiency. In this study, a variable-depth local search algorithm is proposed for solving simple assembly line balancing problems (SALBPs), which are the most widely studied versions of the ALBP. Although the state-of-the-art techniques for solving the SALBP consist of exact enumeration-based methods or heuristics, this paper proposes a local search-based heuristic using variable-length sequences that allow the solution space to be efficiently explored. The proposed algorithm improves the best solution known for multiple instances reported in the literature, indicating that its efficiency is comparable to those of the state-of-the-art method for solving the SALBP. Moreover, the characteristics of the instances for which the proposed procedure provides a better solution than previously reported construction procedures are investigated.
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 0020-7543 ISBN Medium
Area Expedition Conference
Notes WOS:000800928700001 Approved
Call Number UAI @ alexi.delcanto @ Serial 1578
Permanent link to this record