Home
  • English
  • ÄŒeÅ¡tina
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • LatvieÅ¡u
  • Magyar
  • Nederlands
  • Português
  • Português do Brasil
  • Suomi
  • Log In
    New user? Click here to register. Have you forgotten your password?
Home
  • Browse Our Collections
  • Publications
  • Researchers
  • Research Data
  • Institutions
  • Statistics
    • English
    • ÄŒeÅ¡tina
    • Deutsch
    • Español
    • Français
    • Gàidhlig
    • LatvieÅ¡u
    • Magyar
    • Nederlands
    • Português
    • Português do Brasil
    • Suomi
    • Log In
      New user? Click here to register. Have you forgotten your password?
  1. Home
  2. Research Output and Publications
  3. Institute of Engineering Mathematics (IMK)
  4. Theses & Dissertations
  5. Heuristic method for the modified model of capacitated arc routing problems
 
Options

Heuristic method for the modified model of capacitated arc routing problems

Date Issued
2015
Author(s)
Muhamad Hafiz Masran
Universiti Malaysia Perlis
Abstract
The management of waste collection in urban areas is a critical issue for some developing countries especially in Malaysia which requires immediate attention. This study attempts to make an analysis and assessment of the development of the Perlis state waste generation distribution and the optimization of waste collection routes. This thesis describes the architecture design of the mathematical modeling for the mixed graph of Capacitated Arc Routing Problem (MCARP) extended from the Capacitated Arc Routing Problem (CARP). Furthermore, it provides a description of several equations that can be used to obtain efficient collection routes such as capacity vehicles constraint. To get the better result, this study used the existing heuristics method for solving MCARP mathematical modeling. The result shows that the total costs produced are considerably acceptable and are also reasonably improved, although the existing heuristics method do not obtain an optimal solution but in term of the computational time is good and better than other methods for small and intermediate networks especially in the mixed graph problem
Subjects
  • Heuristic algorithms

  • Routing protocols (Co...

  • Salvage (Waste

  • etc.)

  • Arc Routing Problem

  • Capacitated Arc Routi...

File(s)
Full text (This item is protected by original copyright.).pdf (3.03 MB) Declaration Form.pdf (224.76 KB) Page 1-24.pdf (275.12 KB)
Views
6
Acquisition Date
Nov 19, 2024
View Details
Downloads
15
Acquisition Date
Nov 19, 2024
View Details
google-scholar
  • About Us
  • Contact Us
  • Policies