Claim Missing Document
Check
Articles

Found 2 Documents
Search

City Brand Logo Design Methodology Using Local Citizen Participation Approach Wiratama, Danang Adi; Nugroho, Chendri Irawan Satrio
Journal of Multimedia Trend and Technology Vol. 3 No. 3 (2024): Journal of Multimedia Trend and Technology
Publisher : Universitas Amikom Purwokerto

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35671/jmtt.v3i3.78

Abstract

The cruciality of a logo for city branding interests is comparable to the need for seriousness in the design process. Several studies have stated that the main problems with city brand logo design methods are: the ineffective involvement of local communities, and the low understanding that city branding is more than just designing a logo. This study aims to formulate a city brand logo design method that (1) involves local communities and (2) is connected to the overall city branding process. To that end, a study was conducted on city branding theory, brand personality, city brand visual identity, including case studies of city brand logo design in Indonesia. The city brand logo design method formulated here is divided into the idea search stage (research, brand personality exploration, city branding concept) and the visualization stage (testing preferences for logo types and their visual elements). At each stage, community involvement is carried out through questionnaires while the design team plays a role in designing alternatives for the community. This proposed method is able to facilitate collaboration between designers and the community in designing the city's visual identity, as well as providing branding output that is (not only a logo and slogan, but) integrated with the brand's personality, core ideas, and all strategies that play a major role in implementing city branding as a whole.
PENERAPAN ALGORITMA GENETIKA UNTUK PENCARIAN RUTE TERBAIK ANTAR JEMPUT LAUNDRY Saskia, Luthfia; Nugroho, Chendri Irawan Satrio; Widodo, Bambang
Jurnal Informatika Teknologi dan Sains (Jinteks) Vol 7 No 1 (2025): EDISI 23
Publisher : Program Studi Informatika Universitas Teknologi Sumbawa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.51401/jinteks.v7i1.5414

Abstract

Kecepatan kurir dalam mengantarkan pakaian kepada pelanggan berperan penting dalam meningkatkan kepuasan pelanggan terhadap layanan laundry. Namun, dalam praktiknya, menentukan rute optimal untuk kurir bukanlah tugas yang mudah. Kurir sering kali harus mengandalkan pengalaman pribadi atau aplikasi navigasi umum yang tidak selalu memberikan solusi rute terbaik dalam konteks pengiriman multi-titik. Oleh karena itu, diperlukan sebuah sistem yang dapat membantu kurir dalam menentukan rute terpendek atau terbaik, sehingga proses pengantaran pakaian dapat berlangsung dengan efisien dan cepat. Sistem ini memanfaatkan algoritma genetika pada Travelling Salesman Problem (TSP) untuk menemukan rute optimal melalui beberapa tahapan, termasuk inisialisasi populasi, seleksi populasi, crossover, mutasi, dan elitisme. Kurir laundry akan mengantarkan pakaian ke lima blok alamat pelanggan, dan setelah mengunjungi blok terakhir, kurir akan kembali ke blok pertama. Setiap blok diwakili oleh koordinat x dan y, yaitu A (0, 0), B (10, 15), C (5, 9), D (6, 8), dan E (5, 10). Setelah melalui semua tahapan dalam algoritma genetika, rute terbaik yang diperoleh adalah rute Blok E-B-A-D-C dan nilai fitness 37,51