Repository logo
  • English
  • Deutsch
  • Español
  • Français
  • Log In
    New user? Click here to register.Have you forgotten your password?
Universidad Panamericana
  • Communities & Collections
  • Research Outputs
  • Fundings & Projects
  • Researchers
  • Statistics
  • Feedback
  • English
  • Deutsch
  • Español
  • Français
  1. Home
  2. CRIS
  3. Publications
  4. Insular Biobjective Routing with Environmental Considerations for a Solid Waste Collection System in Southern Chile
 
  • Details
Options

Insular Biobjective Routing with Environmental Considerations for a Solid Waste Collection System in Southern Chile

Journal
Advances in Operations Research
ISSN
1687-9147
1687-9155
Date Issued
2017
Author(s)
Daniela S. Arango González
Olivares-Benitez, Elias  
Facultad de Ingeniería - CampGDL  
Pablo A. Miranda
Type
Resource Types::text::journal::journal article
DOI
10.1155/2017/4093689
URL
https://scripta.up.edu.mx/handle/20.500.12552/2815
Abstract
<jats:p>This paper presents a biobjective problem for a solid waste collection system in a set of islands in southern Chile. The first objective minimizes transportation cost and the second one reduces the environmental impact caused by the accumulation of solid waste at the collection points. To solve this problem, biobjective mixed integer linear programming is used. In the model, an itinerary scheme is considered for the visit to the islands. The model decides which collection points are visited per island, the collection pattern, and quantity of solid waste to be collected at each site. The quantity of solid waste is obtained dividing the solid waste generated in the island by the number of collection points selected in that same island and the frequency of visits. For this problem, we considered that the environmental impact function varies through the days during which solid waste is accumulated at each collection point. We present an instance based on real data for a set of islands in Chiloe and Palena regions in southern Chile, in which the deposit node is Dalcahue. We used the epsilon-constraint method and the weighted sum method to obtain the Pareto front, using commercial optimization software.</jats:p>

Copyright 2024 Universidad Panamericana
Términos y condiciones | Política de privacidad | Reglamento General

Built with DSpace-CRIS software - Extension maintained and optimized by - Hosting & support SCImago Lab

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback